Skip to main content
SpringerLink
Log in
Book cover

International Conference on Principles and Practice of Constraint Programming

CP 1996: Principles and Practice of Constraint Programming — CP96 pp 353–366Cite as

A view of local search in constraint programming

  • Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1118))

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. M. Gendreau, A. Hertz, and G. Laporte. New Insertion and Postoptimization Procedures for the Traveling Salesman Problem. Operations Research, 40:1086–1094, 1992.

    Google Scholar 

  5. F. Glover. Heuristic for Integer Programming Using Surrogate Constraints. Decision Sciences, 8:156–166, 1977.

    Google Scholar 

  6. F. Glover, M. Laguna, É. Taillard, and D. de Werra. Tabu Search. volume 41 of Annals of Operations Research. 1993.

    Google Scholar 

  7. F. Glover, É. Taillard, and D. de Werra. A User's Guide to Tabu Search. Annals of Operations Research, 41:3–28, 1993.

    Google Scholar 

  8. J.H. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, MI, 1975.

    Google Scholar 

  9. S. Kirkpatrick, C.D. Gelatt Jr, and M.P. Vecchi. Optimization by Simulated Annealing. Science, 220:671–680, 1983.

    Google Scholar 

  10. S. Lin. Computer Solutions of the Traveling Salesman Problem. Bell System Technical Journal, 44:2245–2269, 1965.

    Google Scholar 

  11. I. Or. Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. PhD thesis, Northwestern University, Evanston, IL, 1976.

    Google Scholar 

  12. I.H. Osman. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41:421–451, 1993.

    Google Scholar 

  13. 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.

    Google Scholar 

  14. 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.

    Google Scholar 

  15. J.-F. Puget. Object-Oriented Constraint Programming for Transportation Problems. In Proceedings of Advanced Software Technology in Air Transport (ASTAIR), 1992.

    Google Scholar 

  16. C.R. Reeves. Modern Heuristic Techniques for Combinatorial Problems. Halsted Press, 1993.

    Google Scholar 

  17. M.W.P. Savelsbergh. Local Search in Routing Problems with Time Windows. Annals of Operations Research, 4:285–305, 1985.

    Google Scholar 

  18. M.M. Solomon. Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Operations Research, 35:254–265, 1987.

    Google Scholar 

  19. É. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Research on Transportation, Université de Montréal, succ. Centre-ville, C.P. 6128, H3C 3J7, Montréal, Canada

    Gilles Pesant & Michel Gendreau

  2. Département d'informatique et de recherche opérationnelle, Université de Montréal, succ. Centre-ville, C.P. 6128, H3C 3J7, Montréal, Canada

    Michel Gendreau

Authors
  1. Gilles Pesant
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Gendreau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eugene C. Freuder

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation