Journal of Heuristics

, Volume 8, Issue 1, pp 43–58 | Cite as

Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows

  • Louis-Martin Rousseau
  • Michel Gendreau
  • Gilles Pesant

Abstract

This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint programming which allow an efficient search of such neighborhoods. The advantages of using a large neighborhood are not only the increased probability of finding a better solution at each iteration but also the reduction of the need to invoke specially-designed methods to avoid local minima. These operators are combined in a variable neighborhood descent in order to take advantage of the different neighborhood structures they generate.

constraint programming local search method metaheuristic hybrid method vehicle routing problem variable neighborhood descent combinatorial optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baptiste, P. C., Le Pape, and W. Nuijten. (1995). “Incorporating Efficient Operations Research Algorithms in Contraint-Based Scheduling.” In Proceedings of the First International JointWorkshop on Artificial Intelligence and Operations Research. Timberline Lodge, Oregon.Google Scholar
  2. Caseau, Y. and F. Laburthe. (to appear). “Heuristics for Large Constrained Vehicle Routing Problems.” Journal of Heuristics.Google Scholar
  3. Caseau, Y. and F. Laburthe. (1997). “Solving Small TSPs with Constraints.” In Proceedings of the 14th International Conference on Logic Programming. Cambridge MA: MIT Press, pp. 316–330.Google Scholar
  4. Caseau, Y. and F. Laburthe. (1998). “SALSA: A Language for Search Algorithms.” In Principle and Practice of Constraint ProgrammingCP98. Pisa, Italy, Oct. 1998.Google Scholar
  5. Caseau, Y., F. Laburthe, and G. Silverstein. “A Meta-Heuristic Factory for Vehicle Routing Problems.” Personal Communication.Google Scholar
  6. De Backer, B. and V. Furnon. (1997). “Meta-heuristics in Constraint Programming Experiments with Tabu Search on the Vehicle Routing Problem.” In Proceedings of the Second International Conference on Metaheuristics (MIC'97). Sophia Antipolis, France, July 1997.Google Scholar
  7. Gendreau, M., F. Guertin, J.-Y. Potvin, and R. Seguin. (1998). “Neighborhood Search Heuristics for a Dynamic Vehicle Dispatching Problem with Pick-Ups and Deliveries.” Publication CRT-98-10, Centre de recherche sur les transports, Université de Montréal, Montréal.Google Scholar
  8. Gendreau, M., A. Hertz, and G. Laporte. (1992). “NewInsertion and Postoptimization Procedures for the Traveling Salesman Problem.” Operations Research 40, 1086–1094.Google Scholar
  9. Gendreau, M., A. Hertz, G. Laporte, and M. Stan. (1995). “A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows.” Operations Research 43, 330–335.Google Scholar
  10. Glover, F. (1996). “Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems.” Discrete Applied Mathmatics 65, 223–253.Google Scholar
  11. Harvey, W. and M. Ginsberg. (1995). “Limited Discrepancy Search.” In Proc. of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95). Montréal, Canada, San Mateo, CA: Morgan Kaufmann, pp. 607–615.Google Scholar
  12. Kilby, P., P. Prosser, and P. Shaw. (1999). “Guided Local Search for the Vehicle Routing Problem with TimeWindows.” In META-HEURISTICS Advances and Trends in Local Search Paradigms for Optimization. Dordrecht: Kluwer Academic Publishers, pp. 473–486.Google Scholar
  13. Meseguer, P. and T. Walsh. (1998). “Interleave and Discrepancy Based Search.” In ECAI 98.Google Scholar
  14. Mladenovic, N. and P. Hansen. (1997). “Variable Neighbourhood Search.” Computer and Operations Research 24, 1097–1100.Google Scholar
  15. Pesant, G. and M. Gendreau. (1996). “A view of Local Search in Constraint Programming.” In Principles and Practice of Constraint ProgrammingCP96: Proceedings of the Second International Conference. Berlin: Springer-Verlag, pp. 353–366. LNCS, 1118.Google Scholar
  16. Pesant, G. and M. Gendreau. (1999). “A Constraint Programming Framework for Local Search Methods.” Journal of Heuristics 5, 255–279.Google Scholar
  17. Pesant, G., M. Gendreau, J.-Y. Potvin, and J.-M. Rousseau. (1998). “An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows.” Transportation Science 32, 12–29.Google Scholar
  18. Pesant, G., M. Gendreau, and J.-M. Rousseau. (1997). “GENIUS-CP: A Generic Vehicle Routing Algorithm.” In Principles and Practice of Constraint ProgrammingCP97: Proceedings of the Third International Conference. Berlin: Springer-Verlag, pp. 420–434. LNCS 1330.Google Scholar
  19. Rego, C. and C. Roucairol. (1996). “A Parallel Tabu Search Algorithm Using Ejection Chain for the Vehicle Routing Problem.” Metaheuristics: Theory and Applications, pp. 661–675.Google Scholar
  20. Rochat, Y. and É. Thaillard. (1995). “Probabilistic Diversification and Intensification in Local Search for Vehicle Routing.” Journal of Heuristics 1, 147–167.Google Scholar
  21. Shaw, P. (1998). “Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems.” In Principle and Practice of Constraint ProgrammingCP98. Pisa, Italy, Oct. 1998. Berlin: Springer-Verlag. LNCS.Google Scholar
  22. Solomon, M.M. (1987). “Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints.” Operations Research 35, 254–265.Google Scholar
  23. Taillard, É., P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin. (1997). “A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows.” Transportation Science 31, 170–186.Google Scholar
  24. Thompson, P. and H.N. Psaraftis. (1993). “Cyclic Transfer Algorithms for Multi-Vehicle Routing and Scheduling Problems.” Operations Research 41, 935–946.Google Scholar
  25. Van Hentenryck, P. (1999). The OPL Optimization Programming Language. Cambridge, MA: MIT Press.Google Scholar

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Louis-Martin Rousseau
    • 1
    • 2
  • Michel Gendreau
    • 1
    • 2
  • Gilles Pesant
    • 3
    • 2
  1. 1.Département informatique et recherche opérationnelleUniversity of MontrealMontréalCanada
  2. 2.Centre for Research on TransportationUniversity of MontrealMontréalCanada
  3. 3.Département de génie électrique et de génie informatiqueÉcole Polytechnique de MontréalMontréalCanada

Personalised recommendations