New state-space relaxations for solving the traveling salesman problem with time windows

INFORMS Journal on Computing

Volumn 24, Issue 3, 2012, Pages 356-371

  Baldacci, Roberto ^a   Mingozzi, Aristide ^a   Roberti, Roberto ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

State space relaxations; Time windows; Traveling salesman problem

Indexed keywords

COLUMN GENERATION; COMPUTATIONAL ANALYSIS; CONVEX COMBINATIONS; DUAL SOLUTIONS; DYNAMIC PROGRAMMING ALGORITHM; EXACT METHODS; LOWER BOUNDS; ROUTING AND SCHEDULING; STATE-SPACE; TIME WINDOWS; WEIGHTED DIGRAPH;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; TRAVELING SALESMAN PROBLEM; VEHICLE ROUTING;

GRAPH THEORY;

EID: 84867561256     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1110.0456     Document Type: Article

References (24)

1. Ascheuer, N., M. Fischetti, M. Grötschel. 2000. A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36(2) 69-79.
2. Ascheuer, N., M. Fischetti, M. Grötschel. 2001. Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Math. Programming Ser. A 90(3) 475-506.
3. Baker, E. K. 1983. An exact algorithm for the time-constrained traveling salesman problem. Oper. Res. 31(5) 938-945.
4. Balas, E., N. Simonetti. 2001. Linear time dynamic-programming algorithms for new classes of restricted TSPs: A computational study. INFORMS J. Comput. 13(1) 56-75.
5. Baldacci, R., A. Mingozzi, R. Roberti. 2011. New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. Forthcoming.
6. Baldacci, R., E. Bartolini, A. Mingozzi, R. Roberti. 2010. An exact solution framework for a broad class of vehicle routing problems. Comput. Management Sci. 7(3) 229-268.
7. Christofides, N., A. Mingozzi, P. Toth. 1981a. An algorithm for the time constrained travelling salesman problem. Technical Report IC OR 8125, Imperial College, London.
8. Christofides, N., A. Mingozzi, P. Toth. 1981b. State-space relaxation procedures for the computation of bounds to routing problems. Networks 11(2) 145-164.
9. Dash, S., O. Günlük, A. Lodi, A. Tramontani. 2012. A time bucket formulation for the traveling salesman problem with time windows. INFORMS J. Comput. 24(1) 132-147.
10. Desaulniers, G., F. Lessard, A. Hadjar. 2008. Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Sci. 42(3) 387-404.
11. Dumas, Y., J. Desrosiers, E. Gélinas, M. M. Solomon. 1995. An optimal algorithm for the traveling salesman problem with time windows. Oper. Res. 43(2) 367-371.
12. Focacci, F., A. Lodi, M. Milano. 2002. A hybrid exact algorithm for the TSPTW. INFORMS J. Comput. 14(4) 403-417.
13. Gendreau, M., A. Hertz, G. Laporte, M. Stan. 1998. A generalized insertion heuristic for the traveling salesman problem with time windows. Oper. Res. 46(3) 330-335.
14. Jepsen, M., B. Petersen, S. Spoorendonk, D. Pisinger. 2008. Subsetrow inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56(2) 497-511.
15. Langevin, A., M. Desrochers, J. Desrosiers, S. Gélinas, F. Soumis. 1993. A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows. Networks 23(7) 631-640.
16. Li, J. Q. 2009. A computational study of bi-directional dynamic programming for the traveling salesman problem with time windows. Working paper, University of California, Berkeley, Berkeley.
17. López-Ibáñez, M., C. Blum. 2010. Beam-ACO for the travelling salesman problem with time windows. Comput. Oper. Res. 37(9) 1570-1583.
18. Mingozzi, A., L. Bianco, S. Ricciardelli. 1997. Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints. Oper. Res. 45(3) 365-377.
19. Ohlmann, J. W., B. W. Thomas. 2007. A compressed-annealing heuristic for the traveling salesman problem with time windows. INFORMS J. Comput. 19(1) 80-90.
20. Ohlmann, J., B. Thomas. 2010. Private communication. (April 7).
21. Pesant, G., M. Gendreau, J.-Y. Potvin, J.-M. Rousseau. 1998. An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation Sci. 32(1) 12-29.
22. Potvin, J.-Y., S. Bengio. 1996. The vehicle routing problem with time windows part II: Genetic search. INFORMS J. Comput. 8(2) 165-172.
23. Righini, G., M. Salani. 2006. Symmetry helps: Bounded bidirectional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim. 3(3) 255-273.
24. Wolfler Calvo, R. 2000. A new heuristic for the traveling salesman problem with time windows. Transportation Sci. 34(1) 113-124.