Abstract
We propose in this paper a novel way of looking at local search algorithms for combinatorial optimization problems which better suits constraint programming by performing branch- and-bound search at their core. We concentrate on neighborhood exploration and show how the framework described yields a more efficient local search and opens the door to more elaborate neighborhoods. Numerical results are given in the context of the traveling salesman problem with time windows. This work on neighborhood exploration is part of ongoing research to develop constraint programming tabu search algorithms applied to routing problems.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Y. Caseau and F. Laburthe. Disjunctive Scheduling with Task Intervals. Technical Report 95-25, Laboratoire d'informatique de l'École Normale Supérieure, Département de mathématiques et d'informatique, 45 rue d'Ulm, 75230 Paris Cedex 05, France, 1995.
N. Christodoulou, E. Stefanitsis, E. Kaltsas, and V. Assimakopoulos. A Constraint Logic Programming Approach to the Vehicle-Fleet Scheduling Problem. In Proceedings of Practical Applications of Prolog, 1994.
Y. Dumas, J. Desrosiers, É. Gélinas, and M.M. Solomon. An Optimal Algorithm for the Traveling Salesman Problem with Time Windows. Operations Research, 43(2):367–371, 1995.
M. Gendreau, A. Hertz, and G. Laporte. New Insertion and Postoptimization Procedures for the Traveling Salesman Problem. Operations Research, 40:1086–1094, 1992.
F. Glover. Heuristic for Integer Programming Using Surrogate Constraints. Decision Sciences, 8:156–166, 1977.
F. Glover, M. Laguna, É. Taillard, and D. de Werra. Tabu Search. volume 41 of Annals of Operations Research. 1993.
F. Glover, É. Taillard, and D. de Werra. A User's Guide to Tabu Search. Annals of Operations Research, 41:3–28, 1993.
J.H. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, MI, 1975.
S. Kirkpatrick, C.D. Gelatt Jr, and M.P. Vecchi. Optimization by Simulated Annealing. Science, 220:671–680, 1983.
S. Lin. Computer Solutions of the Traveling Salesman Problem. Bell System Technical Journal, 44:2245–2269, 1965.
I. Or. Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. PhD thesis, Northwestern University, Evanston, IL, 1976.
I.H. Osman. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41:421–451, 1993.
G. Pesant, M. Gendreau, J.-Y. Potvin, and J.-M. Rousseau. An Optimal Algorithm for the Traveling Salesman Problem with Time Windows using Constraint Logic Programming. Publication CRT-96-15, Centre de recherche sur les transports, Université de Montréal, Montréal, 1996.
J.-Y. Potvin and J.-M. Rousseau. An Exchange Heuristic for Routing Problems with Time Windows. Journal of the Operational Research Society, 46(12):1433–1446, 1995.
J.-F. Puget. Object-Oriented Constraint Programming for Transportation Problems. In Proceedings of Advanced Software Technology in Air Transport (ASTAIR), 1992.
C.R. Reeves. Modern Heuristic Techniques for Combinatorial Problems. Halsted Press, 1993.
M.W.P. Savelsbergh. Local Search in Routing Problems with Time Windows. Annals of Operations Research, 4:285–305, 1985.
M.M. Solomon. Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Operations Research, 35:254–265, 1987.
É. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin. A New Neighborhood Structure for the Vehicle Routing Problem with Time Windows. Publication CRT-95-66, Centre de recherche sur les transports, Université de Montréal, Montréal, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pesant, G., Gendreau, M. (1996). A view of local search in constraint programming. In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_86
Download citation
DOI: https://doi.org/10.1007/3-540-61551-2_86
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61551-4
Online ISBN: 978-3-540-70620-5
eBook Packages: Springer Book Archive