Embedding relaxations in global constraints for solving TSP and TSPTW

Annals of Mathematics and Artificial Intelligence

Volumn 34, Issue 4, 2002, Pages 291-311

  Focacci, Filippo ^a   Lodi, Andrea ^b   Milano, Michela ^b  

^a IBM   (United States)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Constraint propagation; Cost based filtering; Relaxations

Indexed keywords

EID: 0141678845     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1014492408220     Document Type: Article

References (35)

1. N. Ascheuer, M. Fischetti and M. Grötschel, Solving ATSP with time windows by branch-and-cut, Math. Programming (2001), to appear.
2. E. Balas and N. Simonetti, Linear time dynamic programming algorithms for some classes of restricted TSP's (1996), unpublished.
3. E. Balas and P. Toth, Branch and bound methods, in: The Travelling Salesman Problem, eds. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (John Wiley and Sons, 1985).
4. N. Beldiceanu and E. Contejean, Introducing global constraints in CHIP, Math. Comput. Modelling 20 (1994) 97-123.
5. H. Beringer and B. De Backer, Combinatorial problem solving in constraint logic programming with cooperating solvers, in: Logic Programming: Formal Methods and Practical Applications, eds. C. Beierle and L. Plumer (North Holland, 1995).
6. J. Carlier and E. Pinson, An algorithm for solving job shop scheduling, Management Sci. 35 (1995) 164-176.
7. G. Carpaneto, S. Martello and P. Toth, Algorithms and codes for the assignment problem, Ann. Oper. Res. 13 (1988) 193-223.
8. Y. Caseau and F. Laburthe, Solving small TSPs with constraints, in: Proceedings of ICLP '97 (1997).
9. Y. Caseau and F. Laburthe, Solving various weighted matching problems with constraints, in: Proceedings of CP '97 (1997).
10. M. Dell'Amico and S. Martello, Linear assignment, in: Annotated Bibliographies in Combinatorial Optimization, eds. M. Dell'Amico, F. Maffioli and S. Martello (Wiley, 1997).
11. M. Dincbas, P. Van Hentenryck and H. Simonis, Solving the car sequencing problems in Constraint Logic Programming, in: Proceedings of ECAI '88 (1988).
12. M. Dincbas, P. Van Hentenryck and M. Simonis, Solving large combinatorial problems in logic programming, J. Logic Programming 8 (1990) 75-93.
13. M. Dincbas, P. Van Hentenryck, M. Simonis, A. Aggoun, T. Graf and F. Berthier, The constraint logic programming language CHIP, in: Proceedings of the International Conference on Fifth Generation Computer System (1988).
14. Y. Dumas, J. Desrosiers, E. Gelinas and M.M. Solomon, An optimal algorithm for the travelling salesman problem with the time windows, Oper. Res. 43 (1995) 367-371.
15. M. Fischetti and P. Toth, An additive bounding procedure for the asymmetric travelling salesman problem, Math. Programming 53 (1992) 173-197.
16. M. Fischetti and P. Toth, An efficient algorithm for the min-sum arborescence problem on complete digraphs, ORSA J. Comput. 5 (1993) 426-434.
17. F. Focacci, A. Lodi and M. Milano, Cost-based domain filtering, in: Proceedings of CP '99 (1999).
18. F. Focacci, A. Lodi and M. Milano, Solving tsp with time windows with constraints, in: Proceedings of ICLP '99 (1999).
19. M.T. Hajian, H. El-Sakkout, M. Wallace, J.M. Lever and E.B. Richards, Towards a closer integration of finite domain propagation and simplex-based algorithms, technical report, IC-Parc (1995).
20. W.D. Harvey and M.L. Ginsberg, Limited discrepancy search, in: Proceedings of IJCAI '95 (1995).
21. P. Van Hentenryck, Constraint Satisfaction in Logic Programming (MIT Press, 1989).
22. ILOG, ILOG Scheduler 4.4 Reference Manual.
23. ILOG, ILOG Solver 4.4 Reference Manual.
24. M. Jünger, G. Reinelt and G. Rinaldi, The travelling salesman problem, in: Annotated Bibliographies in Combinatorial Optimization, eds. M. Dell'Amico, F. Maffioli and S. Martello (Wiley, 1997).
25. C.H. Papadimitriou and K. Stieglitz, Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, 1982).
26. L. Perron, Integration into constraint programming and parallelization of OR/AI search methods, in: CP-AI-OR '99 Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (1999).
27. G. Pesant, M. Gendreau, J.Y. Potvin and J.M. Rousseau, An exact constraint logic programming algorithm for the travelling salesman problem with time windows, Transportation Sci. 32 (1998) 12-29.
28. J.F. Puget, A C++ implementation of CLP, technical report 94-01 (ILOG Headquarters, 1994).
29. J.C. Régin, A filtering algorithm for constraints of difference in CSPs, in: Proceedings of AAAI '94 (1994).
30. Y. Rochat and E.D. Taillard, Probabilistic diversification and intensification in local search for vehicle routing, J. Heuristics 1 (1995) 147-167.
31. R. Rodosek, M. Wallace and M.T Hajian, A new approach to integrating mixed integer programming and constraint logic programming, Ann. Oper. Res. 86 (1999) 63-87.
32. M.W.P. Savelsberg, Local search in routing poblem with time windows, Ann. Oper. Res. 4 (1985) 285-305.
33. M.M. Solomon, Algorithms for the vehicle routing and scheduling problem with time window constraints, Oper. Res. 35 (1987) 254-265.
34. E.D. Taillard, P. Badeau, M. Gendreau, F. Guertin and J.-Y. Potvin, A new neighborhood structure for the vehicle routing problems with time windows (1995), unpublished.
35. M. Wallace, Practical applications of constraint programming, Constraints 1 (1996) 139-168.