Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints

Operations Research

Volumn 45, Issue 3, 1997, Pages 365-377

  Mingozzi, Aristide ^a   Bianco, Lucio ^b   Ricciardelli, Salvatore ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; GRAPH THEORY; MATRIX ALGEBRA; OPTIMAL CONTROL SYSTEMS; OPTIMIZATION; STATE SPACE METHODS;

STATE SPACE RELAXATION; TIME WINDOW AND PRECEDENCE CONSTRAINTS; TRAVELING SALESMAN PROBLEM;

DYNAMIC PROGRAMMING;

EID: 0031144368     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.45.3.365     Document Type: Article

References (19)

1. ARMSTRONG, G. R. AND R. S. GARFINKEL. 1982. Dynamic Programming Solution of the Single and Multiple Pick-up and Delivery Problem with Application to Dial-a-ride. Working paper 162, College of Business Administration, University of Tennessee, Knoxville.
2. BAKER, E. K. 1983. An Exact Algorithm for the Time-constrained Traveling Salesman Problem. Opns. Res. 31, 938-945.
3. BIANCO, L., A. MINGOZZI, S. RICCIARDELLI, AND M. SPADONI. 1994. Exact and Heuristic Procedures for the Traveling Salesman Problem with Precedence Constraints, Based on Dynamic Programming. Infor 32, 19-32.
4. CHRISTOFIDES, N., A. MINGOZZI, AND P. TOTH. 1981a. An Algorithm for the Time Constrained Traveling Salesman Problem. Report IC-OR-81/12, Imperial College of Science and Technology, London.
5. CHRISTOFIDES, N., A. MINGOZZI, AND P. TOTH. 1981b. State Space Relaxation for the Computation of Bounds to Routing Problems. Networks, 11, 145-164.
6. DESROCHERS, M., J. DESROSIERS, AND M. SOLOMON. 1992. A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows. Opns. Res. 40, 342-354.
7. DESROSIERS, J., Y. DUMAS, AND F. SOUMIS. 1986. A Dynamic Programming Solution of the Large-scale Single-vehicle Dial-a-ride Problem with Time Windows. American J. Math, and Mgmt. Sci. 6, 301-325.
8. DESROSIERS, J., Y. DUMAS, M. SOLOMON, AND F. SOUMIS. 1995. Time Constrained Routing and Scheduling. In Handbooks in Operations Research and Management Science. Volume on Networks, North Holland, Amsterdam.
9. DUMAS, Y., J. DESROSIERS, E. GELINAS, AND M. SOLOMON. 1995. An Optimal Algorithm for the Traveling Salesman Problem with Time Windows. Opns. Res. 43, 367-371.
10. FISHER, M. 1981. The Lagrangian Relaxation for Solving Integer Programming. Mgmt. Sci. 27, 1-18.
11. HOUCK, D. J., JR., J. C. PICARD, M. QUEYRANNE, AND R. R. VEMUGANTI. 1980. The Travelling Salesman Problem as a Constrained Shortest Path Problem: Theory and Computational Experience. Opsearch, 17, 93-109.
12. LANGEVIN, A., M. DESROCHERS, J. DESROSIERS, E. GELINAS, AND F. SOUMIS. 1993. A Two-commodity Flow Formulation for the Traveling Salesman and the Makespan Problems with Time Windows. Networks, 23, 631-640.
13. MARSTEN, R. E. AND T. MORIN. 1978. A Hybrid Approach to Discrete Mathematical Programming. Math. Programming, 14.
14. MINGOZZI, A., S. RICCIARDELLI, AND M. SPADONI. 1991. Al-goritmi Esatti ed Euristici di Programmazione Dinamica per Problemi di Ottimizzazione Combinatoria. Ricerca Operativa, 58, 49-85.
15. MINGOZZI, A. AND S. RICCIARDELLI. 1992. Reduction Techniques for the Traveling Salesman Problem with Time Windows and Precedence Constraints. Working Paper, Department of Mathematics, University of Bologna, Italy.
16. MORIN, T. 1978. Computational Advances in Dynamic Programming. In Dynamic Programming and its Applications. M. Puterman (ed.). Academic Press, New York.
17. MORIN, T. AND R. E. MARSTEN. 1976. Branch and Bound Strategies for Dynamic Programming. Opns. Res. 24, 611-627.
18. PSARAFTIS, H. 1980. A Dynamic Programming Solution to the Single Vehicle Many to Many Immediate Request Dial-a-ride Problem. Transp. Sci. 14, 130-154.
19. PSARAFTIS, H. 1983. An Exact Algorithm for the Single Vehicle Many to Many Dial-a-ride Problem with Time Windows. Transp. Sci. 17, 351-357.