Abstract
We present a general approach for solving Constraint Optimization Problems. In this order, we design a Consistent Neighbourhood which, after each variable assignment, deletes conflicting variables to maintain the constraint consistency. Hence, instead of allowing infeasible moves on complete configurations, we work only on partial consistent ones until a solution is found. This approach is successfully applied in solving four real-life problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Bellman and D. Stuart. Applied Dynamic Programming. Princeton University Press, 1962.
E. Bensana, M. Lemaître, and G. Verfaillie. Benchmark Problems: Earth Observation Satellite Management. Constraints, 4(3):293–299, 1999.
E. Bensana, G. Verfaillie, J.C. Agnèse, N. Bataille, and D. Blumstein. Exact and Inexact Methods for the Daily Management of an Earth Observation Satellite. In Proc. 4th Intl. Symposium on Space Mission Operations and Ground Data Systems, Germany, 1996.
S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex, and G. Verfaillie. Semiring-based CSPs and Valued CSPs: Basic Properties and Comparison. Constraints, 4:199–240, 1999.
J.F. Cordeau, G. Laporte, and A. Mercier. A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows. Journal of Operational Research Society, pages 59:928–936, 2001.
V.D. Cung and T. Defaix. Quelques problèmes d’allocation de fréquences et le Challenge ROADEF’2001. Actes des Tièmes Journées Nationales sur la résolution pratique de Problèmes NP-Complets (JNPC’01), pages 9–19, 2001.
C. Fleurent and J.A. Ferland. Genetic and Hybrid Algorithms for Graph Coloring. Annals of Operations Research, 63:437–461, 1996.
P. Galinier, S. Bisaillon, M. Gendreau, and P. Soriano. Solving the Frequency Assignment Problem with Polarization by Local Search and Tabu. the 6th Triennal Conference of the International Federation of Operational Research Societies (IFORS’02), University of Edinburgh, UK, 8–12 July 2002.
F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.
W.D. Harvey and M.L. Ginsberg. Limited Discrepancy Search. in Proceeding of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pages 607–613, 1995.
M. Lemaître, G. Verfaillie, F. Jouhaud, J.C. Lachiver, and N. Bataille. Selecting and Scheduling Observations of Agile Satellites. Aerospace Science and Technology, 6(5):367–381, 2002.
A. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99–118, 1977.
P. Reininger and A. Caminada. Model for GSM Radio Network Optimization. In 2nd Intl. A CM/IEEE Mobicom Workshop on Discrete Algorithms and Methods for Computing and Communications (DIALM), Dallas, USA, December 1998.
ROADEF’2003 Challenge. Booklet of Abstracts. ROADEF society, France, February 2003.
T. Schiex, H. Fargier, and G. Verfaillie. Valued constraint satisfaction problems: hard and easy problems. in Proc. of the 14th International Joint Conference on Artificial Intelligence, (IJCAI-95), Montreal, Quebec, pages 631–637, 1995.
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. Arc-Consistency and Tabu Search for the Frequency Assignement Problem with Polarisation. In Proc. of the 4th International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR’02), pages 359–372, Le Croisic, France, march 2002.
M. Vasquez and J.K. Hao. A Heuristic Approach for Antenna Positioning in Cellular Network. Journal of Heuristics, 7:443–472, 2001.
M. Vasquez and J.K. Hao. A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite. Computational Optimization and Applications, 20:137–157, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Vasquez, M., Dupont, A., Habet, D. (2005). Consistent Neighbourhood in a Tabu Search. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds) Metaheuristics: Progress as Real Problem Solvers. Operations Research/Computer Science Interfaces Series, vol 32. Springer, Boston, MA. https://doi.org/10.1007/0-387-25383-1_17
Download citation
DOI: https://doi.org/10.1007/0-387-25383-1_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25382-4
Online ISBN: 978-0-387-25383-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)