An exact constraint logic programming algorithm for the traveling salesman problem with time windows

Transportation Science

Volumn 32, Issue 1, 1998, Pages 12-28

  Pesant, Gilles ^a   Gendreau, Michel ^a   Potvin, Jean Yves ^a   Rousseau, Jean Marc ^a,b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b INSTITUTE FOR RESEARCH IN IMMUNOLOGY AND CANCER   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; HEURISTIC PROGRAMMING; LOGIC PROGRAMMING; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING;

CONSTRAINT LOGIC PROGRAMMING; EXACT ALGORITHM; HEURISTIC ALGORITHM; TRAVELLING SALESMAN PROBLEM WITH TIME WINDOW;

ALGORITHMS;

EID: 0032000244     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.32.1.12     Document Type: Article

References (36)

1. AHO, A. V., J. E. HOPCKOFT, AND J. D. ULLMAN, Data Structures and Algorithms, Addison-Wesley, Reading, Mass. 1983.
2. BAKER, E., "An Exact Algorithm for the Time Constrained Traveling Salesman Problem," Opns. Res. 31, 938-945 (1983).
3. BAPTISTE, P., C. LE PAPE, AND W. NUIJTEN, "Incorporating Efficient Operations Research Algorithms in Constraint-Based Scheduling," in Proceedings of the 1st International Joint Workshop on Artificial Intelligence and Operations Research, Timberline Lodge, Oregon, 1995.
4. CAELIER, J. AND E. PINSON, "An Algorithm for Solving the Job Shop Problem," Mgmt. Sci. 35, 164-176 (1989).
5. CASEAU, Y. AND P. KOPPSTEIN, "A Rule-Based Approach to a Time-Constrained Traveling Salesman Problem," in Symposium on Artificial Intelligence and Mathematics, 1992. Also, Bellcore Technical Memorandum, 1993.
6. CASEAU, Y. AND F. LABURTHE, "Improved CLP Scheduling with Task Intervals," In Proceedings of the 11th International Conference on Logic Programming, P. van Hentenryck (ed.), MIT Press, Cambridge, Mass. 1994.
7. CHRISTOFIDES, N., A. MINGOZZI, AND P. TOTH, "State Space Relaxation Procedures for the Computation of Bounds to Routing Problems," Networks 11, 145-164 (1981).
8. DESROCHERS, M., J. DESROSIERS, AND M. M. SOLOMON, "A New Optimisation Algorithm for the Vehicle Routing Problem with Time Windows," Opns. Res. 40, 342-354 (1992).
9. DESROSIERS, J., Y. DUMAS, M. M. SOLOMON, AND F. SOUMIS, "Time Constrained Routing and Scheduling," In Network Routing, Vol. 8 of Handbooks in Operations Research and Management Science, M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser (eds.), North-Holland, Amsterdam, 35-139, 1995.
10. DIAZ, D. AND P. CODOGNET, "A Minimal Extension of the WAM for clp(FD)," in Proceedings of the 10th International Conference on Logic Programming, MIT Press, Cambridge, Mass. 774-790, 1993.
11. DINCBAS, M., P. VAN HENTENRYCK, H. SIMONIS, A. AGGOUN, T. GRAF, AND F. BERTHIER, "The Constraint Logic Programming Language CHIP," In Proceedings of the International Conference on 5th Generation Computer Systems, Ohmsha Publishers, Tokyo, 693-702, 1988.
12. DUMAS, Y., J. DESROSIERS, É. GÉLINAS, AND M. M. SOLOMON, "An Optimal Algorithm for the Traveling Salesman Problem with Time Windows," Opns. Res. 43, 367-371 (1995).
13. European Computer-Industry Research Center, ECLiPSe 3.5.1 User Manual, Munich, Germany, 1995.
14. GENDREAU, M., A. HERTZ, AND G. LAPORTE, "New Insertion and Postoptimization Procedures for the Traveling Salesman Problem," Opns. Res. 40, 1086-1094 (1992).
15. GENDREAU, M., A. HERTZ, G. LAPORTE, AND M. STAN, A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows, Publication CRT-95-07, Centre de recherche sur les transports, Université de Montréal, Montréal, 1995.
16. HARALICK, R. M. AND G. L. ELLIOTT, "Increasing Tree Search Efficiency for Constraint Satisfaction Problems," Artificial Intelligence 14, 263-313 (1980).
17. JAFFAR, J. AND J.-L. LASSEZ, Constraint Logic Programming, Technical report 86/73, Dept. of Computer Science, Monash University, June 1986, (An abstract appears in the Proceedings of the 14th ACM Symposium on Principles of Programming Languages, Munich (January 1987), 111-119.).
18. JAFFAR, J. AND J.-L. LASSEZ, "From Unification to Constraints," in Proceedings of the 6th Japanese Conference on Logic Programming, E. Wada, K. Furukawa, H. Tanaka, and T. Fujisaki (eds.), Tokyo, June 1987.
19. JAFFAR, J. AND M. J. MAHER, "Constraint Logic Programming: A Survey," J. Logic Program. 19/20, 503-581 (1994).
20. KANELLAKIS, P. C., G. M. KUPER, AND P. Z. REVESZ, "Constraint Query Languages," J. Comput. System Sci. 51, 26-52 (1995).
21. LANGEVIN, A., M. DESROCHERS, J. DESROSIERS, AND F. SOUMIS, "A Two-Commodity Flow Formulation for the Traveling Salesman and Makespan Problems with Time Windows," Networks 23, 631-640 (1993).
22. MINGOZZI, A., L. BIANCO, AND S. RICCIARDELLI, "Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints," Technical report, Department of Mathematics, University of Bologna, 1993.
23. PESANT, G. AND M. GENDREAU, "A View of Local Search in Constraint Programming," In Principles and Practice of Constraint Programming - CP96: Proceedings of the 2nd International Conference, Vol. 1118 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 353-366, 1996.
24. POTVIN, J.-Y., T. KERVAHUT, B. L. GARCIA, AND J.-M. ROUSSEAU, A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows, Publication CRT-855, Centre de recherche sur les transports, Université de Montréal, Montréal, 1993.
25. PUGET, J.-F., "Object-Oriented Constraint Programming for Transportation Problems," In Proceedings of Advanced Software Technology in Air Transport (ASTAIR), 1992.
26. PUJET, J.-F., A C+ + Implementation of CLP, Technical report 94-01, ILOG S.A., Gentilly, France, 1994.
27. ROCHAT, Y. AND É. TAILLARD, "Probabilistic Diversification and Intensification in Local Search for Vehicle Routing," J. Heuristics 1, 147-167 (1995).
28. SARASWAT, V. A., Concurrent Constraint Programming Languages, Ph.D. thesis, Carnegie-Mellon University, 1989.
29. SAVELSBERG, H. M. W. P., "Local Search in Routing Problems with Time Windows," Ann. Opns. Res. 4, 285-305 (1985).
30. SAVELSBERGH, M. W. P., "The Vehicle Routing Problem with Time Windows: Minimizing Route Duration," ORSA J. Comput. 4, 146-154 (1992).
31. SOLOMON, M. M., "Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints," Opns. Res. 35, 254-265 (1987).
32. 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.
33. THANGIAH, S. R., I. H. OSMAN, AND T. SUN, Hybrid Genetic Algorithms, Simulated Annealing and Tabu Search Methods for Vehicle Routing Problems with Time Windows, Technical report UKC/OR94/4, Institute of Mathematics and Statistics, University of Kent, Canterbury, UK, 1994.
34. TSANG, E., Foundations of Constraint Satisfaction, Academic Press, London, 1993.
35. VAN HENTENRYCK, P., V. SARASWAT, AND Y. DEVILLE, Design, Implementations and Evaluation of the Constraint Language cc(ℱscript D sign), Technical report CS-93-02, Brown University, 1993.
36. WALTZ, D. L., Generating Semantic Descriptions from Drawings of Scenes with Shadows, Technical report AI-TR-271, MIT, 1972.