A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows

References

• Baker E. K. An exact algorithm for the timeconstrained traveling salesman problem. Opns Res. (1983) 31 938 945 Link, Google Scholar
• Carter M. W. , Farvolden J. M. , Laporte G. , Xu J. Solving an integrated logistics problem arising in grocery distribution. INFOR. (1996) 34 290 306 Google Scholar
• Christofides N. , Mingozzi A. , P. Toth P. State space relaxation for the computation of bounds to routing problems. Networks (1981) 11 145 164 Crossref, Google Scholar
• Desrochers M. , Desrosiers J. , Solomon M. M. A new optimization algorithm for the vehicle routing problem with time windows. Opns. Res. (1992) 40 342 354 Link, Google Scholar
• Desrosiers J. , Dumas Y. , Soumis F. A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. Amer. J. Math. Management Sci. (1986) 6 301 325 Crossref, Google Scholar
• Desrosiers J. , Dumas Y. , Solomon M. M. , Soumis F. , Ball M. O. , Magnanti T. L. , Monma C. L. , Nemhauser G. L. Time constrained routing and scheduling. Handbooks in Operations Research and Management Science (1995) (North-Holland, Amsterdam) 35 139 Google Scholar
• Dumas Y. , Desrosiers J. , Gélinas É. , Solomon M. M. An optimal algorithm for the traveling salesman problem with time windows. Opns. Res. (1995) 43 367 371 Link, Google Scholar
• Gendreau M. , Hertz A. , Laporte G. New insertion and postoptimization procedures for the traveling salesman problem. Opns. Res. (1992) 40 1086 1094 Link, Google Scholar
• Gendreau M. , Hertz A. , Laporte G. A tabu search heuristic for the vehicle routing problem. Management Sci. (1994) 40 1276 1290 Link, Google Scholar
• Kohl N. Exact methods for time constrained routing and related scheduling problems. (1995) . Ph.D. dissertation, IMM-DTU Technical University of Denmark, Denmark Google Scholar
• Langevin A. , Desrochers M. , Desrosiers J. , Gélinas S. , Soumis F. A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows. Networks (1993) 23 631 640 Crossref, Google Scholar
• Mingozzi A. , Bianco L. , Ricciardelli S. Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints. (1994) . Working paper, Department of Mathematics, University of Bologna, Italy Google Scholar
• Potvin J.-Y. , Kervahut T. , Garcia B. L. , Rousseau J.-M. The vehicle routing problem with time windows—Part I: Tabu search. INFORMS J. Comput. (1996) 8 158 164 Link, Google Scholar
• Psaraftis H. A dynamic programming solution to the single vehicle many to many immediate request dial-a-ride problem. Transportation Sci. (1980) 14 130 154 Link, Google Scholar
• Psaraftis H. An exact algorithm for the single vehicle many to many dial-a-ride problem with time windows. Transportation Sci. (1983) 17 351 357 Link, Google Scholar
• Renaud J. , Boctor F. F. , Laporte G. A fast composite heuristic for the symmetric traveling salesman problem. INFORMS J. Comput. (1996) 8 134 143 Link, Google Scholar
• Savelsbergh M.W.P. Local search for routing problems with time windows. Anns. Opns. Res. (1985) 4 285 305 Crossref, Google Scholar
• Savelsbergh M.W.P. The vehicle routing problem with time windows: Minimizing route duration. (1989) . Working paper, Centre for Mathematics and Computer Science, Amsterdam Google Scholar
• Solomon M. M. Algorithms for the vehicle routing and scheduling problem with time windows constraints. Opns. Res. (1987) 35 254 265 Link, Google Scholar