Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-30T23:48:18.470Z Has data issue: false hasContentIssue false
  • English
  • Français

Consistency checking within local search applied to the frequency assignmentwith polarization problem

Published online by Cambridge University Press:  15 March 2004

Michel Vasquez ,
Audrey Dupont  and
Djamal Habet
Michel Vasquez
Affiliation:
Centre LGI2P, École des mines d'Alès, site EERIE, 30035 Nîmes Cedex 1, France; [email protected]., [email protected]., [email protected].
Audrey Dupont
Affiliation:
Centre LGI2P, École des mines d'Alès, site EERIE, 30035 Nîmes Cedex 1, France; [email protected]., [email protected]., [email protected].
Djamal Habet
Affiliation:
Centre LGI2P, École des mines d'Alès, site EERIE, 30035 Nîmes Cedex 1, France; [email protected]., [email protected]., [email protected].
Get access

Abstract

We present a hybrid approach for the FrequencyAssignment Problem with Polarization. This problem, viewed asMax-CSP, is treated as a sequence of decision problems, CSPlike. The proposed approach combines the Arc-Consistencytechniques with a performed Tabu Search heuristic. The resultingalgorithm gives some high quality solutions and has proved itsrobustness on instances with approximately a thousand variablesand nearly ten thousand constraints.

Keywords

Filtering techniquesconsistency checkingTabu Search.
Type
Research Article
Information
RAIRO - Operations Research , Volume 37 , Issue 4: ROADEF 2002 , October 2003 , pp. 311 - 323
Copyright
© EDP Sciences, 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Aardal, K.I., Hurkens, C.A.J., Lenstra, J.K. and Tiourine, S.R., Algorithms for Frequency Assignment Problems. CWI Quartely 9 (1996) 1-9.
Bessière, C., Arc-consistency and Arc-consistency again. Artif. Intell. 65 (1994) 179-190 . CrossRef
C. Bessière and J.C. Régin, Refining the Basic Consistency Propagation Algorithm, in the 17th International Joint Conference on Artificial Intelligence (IJCAI'01), Seattle-Washington, USA (2001) 309-315.
R. Dorne, Étude des méthodes heuristiques pour la coloration, la T-coloration et l'affectation de fréquences. Ph.D. thesis, Université Montpellier II Sciences et Techniques du Languedoc (mai 1998).
Fleurent, C. and Ferland, J.A., Genetic and Hybrid Algorithms for Graph Coloring. Ann. Oper. Res. 63 (1996) 437-461. CrossRef
P. Galinier, Étude des métaheuristiques pour la résolution du problème de satisfaction de contraintes et de coloration de graphes. Ph.D. thesis, Université Montpellier II Sciences et Techniques du Languedoc (janvier 1999).
P. Galinier, S. Bisaillon, M. Gendreau and P. Soriano, Solving the Frequency Assignment Problem with Polarization by Local Search and Tabu, in The 6th Triennal Conference of the International Federation of Operational Research Societies (IFORS'02), University of Edinburgh, UK (July 2002) 8-12.
F. Glover and M. Laguna, Tabu Search. Kluwer Academic Publishers (1997).
Hansen, P. and Mladenovic, N., Variable Neighborhood Search. Comput. Oper. Res. 24 (1997) 1097-1100 .
W.D. Harvey and M.L. Ginsberg, Limited Discrepancy Search, in Proc. of the 14th International Joint Conference on Artificial intelligence (IJCAI-95) (1995) 607-613.
M. Jiang, Méthodes Approchées pour le Problème de Coloriage Généralisé Application au Problème d'Allocation de Fréquences Multiservices dans l'Aviation Civile. Ph.D. thesis, Université Versailles Saint-Quentin-en-Yvelines (novembre 1996).
Mackworth, A.K., Consistency in Networks of Relations. Artif. Intell. 8 (1977) 99-118. CrossRef
Mohr, R. and Henderson, T.C., Arc and Path Consistency revisited. Artif. Intell. 28 (1986) 225-233 . CrossRef
P Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, in Principle and Pratice of Constraint Programming, CP'98 (October 1998).
M. Vasquez, Résolution en variables 0-1 de problèmes combinatoires de grande taille par la méthode tabou. Ph.D. thesis, Université d'Angers, UFR de Sciences (December 2000).
Vasquez, M. and Hao, J.K., A "Logic-Constrained" Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite. Comput. Optim. Appl. 20 (2001) 137-157 . CrossRef