New heuristic for the Traveling Salesman Problem with Time Windows

Transportation Science

Volumn 34, Issue 1, 2000, Pages 113-124

  Calvo, Roberto Wolfler ^a,b  

^a JOINT RESEARCH CENTRE   (Italy)

^b POLITECNICO DI MILANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

TRAVELING SALESMAN PROBLEM WITH TIME WINDOWS (TSPTW);

MOTOR TRANSPORTATION;

EID: 0033905256     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.34.1.113.12284     Document Type: Article

References (22)

1. E. K. BAKER, "An Exact Algorithm for the Time-Constrained Traveling Salesman Problem," Opns. Res. 31, 939-945 (1983).
2. L. BIANCO, A. MINGOZZI, AND S. RICCIARDELLI, "Dynamic Programming Strategies for the Traveling Salesman Problem with Time Windows and Precedence Constraints," Opns. Res. 45, 365-378, (1998).
3. R. CORDONE AND R. WOLFLER CALVO, Note on Time Windows Constraints in Routing Problems, Internal report 96-005, Politecnico di Milano, 1996.
4. R. CORDONE, AND R. WOLFLER CALVO, A Heuristic for the Vehicle Routing Problem with Time Windows, Internal report 97-012, Politecnico di Milano, 1997.
5. M. DELL'AMICO AND S. MARTELLO, "Linear Assignment," in Annotated Bibliographies in Combinatorial Optimization, M. Dell'Amico, F. Maffioli and S. Martello (eds.), John Wiley & Sons, Chichester, U.K., 355-371, 1997.
6. J. DEROSIERS, Y. DUMAS, M. M. SOLOMON AND F. SOUMIS, "Time Constrained Routing and Scheduling," in Handbook in Operations Research and Management Science, 35-139, North-Holland, Amsterdam, 1994.
7. J. J. DONGARRA, Performance of Various Computers Using Linear Equations Software, Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TN, 1997.
8. Y. DUMAS, J. DESROSIERS, E. GÉLINAS, AND M. M. SOLOMON, "An Optimal Algorithm for the Traveling Salesman Problem with Time Windows," Opns. Res. 45, 367-371, (1995).
9. M. GENDREAU, A. HERTZ, G. LAPORTE, AND M. STAN, "A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows," Opns. Res. 46, 330-335 (1998).
10. General Processor Information, http://infopad.eecs.berkley. edu/CIC/, (last modified 13 January 1997)
11. A file of reported SPEC CINT/CFP benchmark results for various machines, available via anonymous ftp from ftp.cdf.toronto.edu in /pub/spectable/
12. P. HEALY AND R. MOLL, "A New Extension of Local Search Applied to the Dial-a-Ride Problem," Eur. J. Oper. Res. 83, 83-104, (1995).
13. G. A. P. KINDERVATER AND M. W. P. SAVELSBERGH, "Vehicle Routing: Handling Edge Exchanges," in Local Search in Combinatorial Optimization, J. K. Lenstra and E. H. L. Aarts (eds.), Wiley, Chichester, 337-360, 1997.
14. A. LANGEVIN, M. DESROCHERS, J. DESROSIERS, AND F. SOUMIS, "A Two Commodity Flow Formulation for the Traveling Salesman and Makespan Problems with Time Windows," Network. 23, 631-640, (1993).
15. S. LIN, "Computer Solutions to the Travelling Salesman Problem," Bell Syst. Tech. J. 44, 2245-2269, (1965).
16. C. MILLER, A. TUCKER, AND R. ZEMLIN, "Integer Programming Formulations of Traveling Salesman Problems," JACM, 7, 326-329 (1960).
17. L. BIANCO, A. MINGOZZI, AND S. RICCIARDELLI, "Dynamic Programming Strategies for the Traveling Salesman Problem with Time Windows and Precedence Constraints," Opns. Res. 45, 365-378, (1998).
18. G. PESANT, M. GENDREAU, J.-Y. POTVIN, J.-M. ROUSSEAU, An Exact Constraint Logic Programming Algorithm for the TSP with Time Windows, Publication CRT-96-15, Centre de recherche sur les transports, Universite de Montreal, Montreal, 1996.
19. J. Y. POTVIN AND S. BENGIO, "The Vehicle Routing Problem with Time Windows. II. Genetic Search," INFORMS J. of Comput. 8, 165-172, (1996).
20. R. A. RUSSELL, "An Effective Heuristic for the m-Tour Travelling Salesman Problem with Some Side Conditions," Opns. Res. 25, 517-524, (1977).
21. M. W. P. SAVELSBERGH, "Local Search in Routing Problems with Time Windows," Ann. Opns. Res. 4, 285-305, (1985).
22. M. M. SOLOMON, "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Opns. Res. 35, 254-265, (1987).