On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem

European Journal of Operational Research

Volumn 117, Issue 2, 1999, Pages 253-263

  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

ALGORITHMS; CONSTRAINT THEORY; ITERATIVE METHODS; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; SET THEORY; STRATEGIC PLANNING;

BRANCH AND BOUND METHODS; CONSTRAINT PROGRAMMING; ITERATIVE-COST-DEEPENING; MULTIPLE TIME WINDOWS;

TRAVELING SALESMAN PROBLEM;

EID: 0032650526     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00248-3     Document Type: Article

References (24)

1. P. Baptiste, C. Le Pape, W. Nuijten, Incorporating Efficient Operations Research Algorithms in Constraint-Based Scheduling, in: Proceedings of the First International Joint Workshop on Artificial Intelligence and Operations Research, Timberline Lodge, OR, 1995.
2. W.J. Bell, L.M. Dalberto, M.L. Fisher, A.J. Greenfield, R. Jaikumar, P. Kedia, R.G. Mack, P.J. Prutzman, Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer, Interfaces 13 (6) (1983) 4-23.
3. P. Boizumault, Y. Delon, L. Peridy, Constraint Logic Programming for Examination Timetabling, Journal of Logic Programming 26 (2) (1995) 217-233.
4. Y. Caseau, P. Koppstein, A rule-based approach to a time-constrained traveling salesman problem, in: Second International Symposium on Artificial Intelligence and Mathematics, 1992, Technical Memorandum, Bellcore, Red Bank, NJ, 1993.
5. Y. Caseau, F. Laburthe, Improved CLP Scheduling with Task Intervals, in: Proceedings of the 11th International Conference on Logic Programming, MIT Press, Cambridge, MA, 1994, pp. 369-383.
6. Y. Caseau, F. Laburthe, Solving small TSPs with constraints, in: Proceedings of the 14th International Conference on Logic Programming, MIT Press, Cambridge MA, 1997, pp. 316-330.
7. M. Desrochers, J. Desrosiers, M.M. Solomon, A new optimisation algorithm for the vehicle routing problem with time windows, Operations Research 40 (1992) 342-354.
8. J. Desrosiers, Y. Dumas, M.M. Solomon, F. Soumis, Time constrained routing and scheduling, in: M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (Eds.), Network Routing, Handbooks in Operations Research and Management Science, vol. 8, North-Holland, Amsterdam, 1995, pp. 35-139.
9. European Computer-Industry Research Center, Munich, Germany, ECLiPSe 3.5.1 User Manual, 1995.
10. P.W. Frizzell, J.W. Giffin, The split delivery vehicle scheduling problem with time windows and grid network distances, Computers and Operations Research 22 (1995) 655-667.
11. M. Henz, J. Würtz, Constraint-based timetabling - A case study, Applied Artificial Intelligence 10 (1996) 439-453.
12. J. Huang, U.S. Palekar, S.G. Kapoor, A labeling algorithm for the navigation of automated guided vehicles, Journal of Engineering for Industry 115 (1993) 315-321.
13. ILOG S.A., 12, Avenue Raspail, BP7, 94251 Gentilly Cedex, France. ILOG SOLVER: Object-oriented constraint programming, 1995.
14. R.E. Korf, Optimal path-finding algorithms, in: L. Kanal, V. Kumar (Eds.), Search in Artificial Intelligence, Springer, Berlin, 1988, pp. 223-267.
15. A. Langevin, M. Desrochers, J. Desrosiers, F. Soumis, A two-commodity flow formulation for the traveling salesman and makespan problems with time windows, Networks 23 (1993) 631-640.
16. C. Le Pape, Implementation of resource constraints in ILOG SCHEDULE: A library for the development of constraint-based scheduling systems, Intelligent Systems Engineering 3 (1994) 55-66.
17. W. Nuijten, E. Aarts, A computational study of constraint satisfaction for multiple capacitated job shop scheduling, European Journal of Operational Research 90 (1996) 269-284.
18. G. Pesant, M. Gendreau, J.-Y. Potvin, J.-M. Rousseau, An exact constraint logic programming algorithm for the traveling salesman problem with time windows, Transportation Science 32 (1998) 12-29.
19. G. Pesant, M. Gendreau, J.-M. Rousseau, GENIUS-CP: A generic vehicle routing algorithm, in: Principles and Practice of Constraint Programming - CP97: Proceedings of the Third International Conference, Springer-Verlag LNCS 1330, Berlin, 1997, pp. 420-434.
20. Y. Rochat, É. Taillard, Probabilistic diversification and intensification in local search for vehicle routing, Journal of Heuristics 1 (1995) 147-167.
21. M.M. Solomon, Algorithms for the vehicle routing and scheduling problem with time window constraints, Operations Research 35 (1987) 254-265.
22. E. Taillard, P. Badeau, M. Gendreau, F. Guertin, J.-Y. Potvin, A tabu search heuristic for the vehicle routing problem with soft time windows, Transportation Science 31 (1997) 170-186.
23. M. Wallace, Practical applications of constraint programming, Constraints 1 (1996) 139-168.
24. M. Yoshikawa, K. Kaneko, T. Yamanouchi, M. Watanabe, A constraint-based high school scheduling system, IEEE Expert 11 (1996) 63-72.