Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study

INFORMS Journal on Computing

Volumn 13, Issue 1, 2001, Pages 56-75

  Balas, Egon ^a   Simonetti, Neil ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Bryn Athyn College of the New Church   (United States)

Author keywords

Algorithms; Complexity; Dynamic Programming; Heuristics; Traveling Salesman Problem; Vehicle routing

Indexed keywords

EID: 0346452839     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.13.1.56.9748     Document Type: Article

References (23)

1. Applegate, D., R. E. Bixby, V. Chvatal, W. J. Cook. 1997. A new paradigm for finding cutting planes in the TSP International Symposium on Mathematical Programming, Lausanne, Switzerland.
2. Ascheuer, N., M. Fischetti, M. Grötschel. 1997. Solving ATSP with time windows by branch-and-cut. Technical report, ZIB Berlin.
3. Baker, E. 1983. An exact algorithm for the time-constrained traveling salesman problem. Operations Research 31 938-945.
4. Balas, E. 1999. New classes of efficiently solvable generalized traveling salesman problems. Annals of Operations Research 86 529-558.
5. Balas, E. 1989. The prize collecting traveling salesman problem. Networks 19 621-636.
6. Burkard, R. E., V. G. Deineko, R. van Dal, J. A. A. van der Veen, G. J. Woeginger. 1997. Well solvable special cases of the TSP: a survey. SFB Report 52, Technical University, Graz, Austria.
7. Dumas, Y., J. Desrosiers, E. Gelinas, M. Solomon. 1995. An optimal algorithm for the traveling salesman problem with time windows. Operations Research 43 367-371.
8. Gendreau, M., A. Hertz, G. Laporte, M. Stan. 1995. A generalized insertion heuristic for the traveling salesman problem with time windows. CRT-95-07, Centre de Recherche sur les Transports, Université de Montréal, Montréal, PQ, Canada.
9. Gilmore, P. C., E. L. Lawler, D. Shmoys. 1985. Well-solved special cases. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. Shmoys eds. The Traveling Salesman Problem: A Guided Tour to Combinatorial Optimization. Wiley, New York. 87-145.
10. Johnson, D. S., L. A. McGeoch. 1997. The traveling salesman problem: a case study in local optimization. E. H. L. Aarts, J. K. L. Lenstra eds. Local Search in Combinatorial Optimization. Wiley, New York. 215-311.
11. Jünger, M., G. Reinelt, G. Rinaldi. 1995. The traveling salesman problem. M. Ball, T. Magnanti, C. Monma, G. Nemhauser eds. Network Models. Elsevier 225-330.
12. Kanellakis, P., C. Papadimitriou. 1980. Local search for the traveling salesman problem. Operations Research 28 1086-1099.
13. Lin, S., B. W. Kernighan. 1973. An effective heuristic algorithm for the traveling salesman problem. Operations Research 21 495-516.
14. Martin, O., S. W. Otto, E. W. Felten. 1992. Large step markov chains for the TSP incorporating local search heuristics Operations Research Letters 11. 219-225.
15. Or, I. 1992. Traveling salesman-type combinatorial problems arid their relation to the logistics of regional blood banking. Ph.D. Thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.
16. Potvin, J. Y., S. Bengio. 1993. A genetic approach to the vehicle routing problem with time windows. CRT-93-5, Centre de Recherche sur les Transports, Université de Montréal, Montreal, PQ, Canada.
17. Reinelt, G. 1997. Personal communication.
18. Repetto, B. 1996. Personal communication.
19. Repetto, B. 1994. Upper and Lower Bounding Procedures for the Asymmetric Traveling Salesman Problem. Ph.D. Thesis, GSIA, Carnegie Mellon University, Pittsburgh, PA.
20. Solomon, M. 1987. Algorithms for vehicle routing and scheduling with time window constraints. Operations Research 35. 254-265.
21. Stan, M. 1997. Personal communication.
22. Tama, J. 1990. Polyhedral Aspects of Scheduling Problems with an Application to the Time-Constrained Traveling Salesman Problem. Ph.D. thesis, GSIA, Carnegie Mellon University, Pittsburgh, PA.
23. Van der Veen, A. A. 1992. Solvable Cases of the Traveling Salesman Problem with Various Objective Functions. Ph.D. Dissertation, University of Groningen, Gronigen, The Netherlands.