A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows

References

• ABACUS A branch-and-cut system. . http://www.informatik.uni-koeln.de/abacus/Google Scholar
• Albiach J., Sanchis J. M., Soler D. An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation. Eur. J. Oper. Res. (2008) 189(3):789–802Crossref, Google Scholar
• Appelgren L. H. A column generation algorithm for a ship scheduling problem. Transportation Sci. (1969) 3(1):53–68Link, Google Scholar
• Ascheuer N. Hamiltonian path problems in the on-line optimization of flexible manufacturing systems. (1995) . Ph.D. thesis, Technische Universität Berlin, BerlinGoogle Scholar
• Ascheuer N., Fischetti M., Grötschel M. A polyhedral study of the asymmetric travelling salesman problem with time windows. Networks (2000) 36(2):69–79Crossref, Google Scholar
• Ascheuer N., Fischetti M., Grötschel M. Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Math. Programming Ser. A (2001) 90(3):475–506Crossref, Google Scholar
• Baker E. K. An exact algorithm for the time-constrained traveling salesman problem. Oper. Res. (1983) 31(5):938–945Link, Google Scholar
• Balas E., Simonetti N. Linear time dynamic programming algorithms for new classes of restricted TSPs: A computational study. INFORMS J. Comput. (2001) 13(1):56–75Link, Google Scholar
• Balas E., Fischetti M., Pulleyblank W. R. The precedence-constrained asymmetric traveling salesman polytope. Math. Programming Ser. A (1995) 68(3):241–265Crossref, Google Scholar
• Christofides N., Mingozzi A., Toth P. State-space relaxation procedures for the computation of bounds to routing problems. Networks (1981) 11(2):145–164Crossref, Google Scholar
• Cordeau J. F., Desaulniers G., Desrosiers J., Solomon M. M., Soumis F., Toth P., Vigo D. VRP with time windows. The Vehicle Routing Problem (2002) (SIAM, Philadelphia) 157–194Crossref, 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. Network Routing (1995) (Elsevier, Amsterdam) 35–139Crossref, Google Scholar
• Dumas Y., Desrosiers J., Gelinas E., Solomon M. M. An optimal algorithm for the travelling salesman problem with time windows. Oper. Res. (1995) 43(2):367–371Link, Google Scholar
• Focacci F., Lodi A., Milano M. A hybrid exact algorithm for the TSPTW. INFORMS J. Comput. (2002) 14(4):403–417Link, Google Scholar
• Langevin A., Desrochers M., Desrosiers J., Soumis F. A two-commodity flow formulation for the traveling salesman and makespan problem with time windows. Networks (1993) 23(7):631–640Crossref, Google Scholar
• Levin A. Scheduling and fleet routing models for transportation systems. Transportation Sci. (1971) 5(3):232–255Link, Google Scholar
• Mingozzi A., Bianco L., Ricciardelli S. Dynamic programming strategies for the traveling salesman problem with time windows and precedence constraints. Oper. Res. (1997) 45(3):365–377Link, Google Scholar
• Pesant G., Gendreau M., Potvin J.-Y., Rousseau J. M. An exact constraint logic programming algorithm for the travelling salesman problem with time windows. Transportation Sci. (1998) 32(1):12–29Link, Google Scholar
• Rochat Y., Taillard E. D. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics (1995) 1(1):147–167Crossref, Google Scholar
• Savelsbergh M. W. P. Local search in routing problems with time windows. Ann. Oper. Res. (1985) 4(1):285–305Crossref, Google Scholar
• Solomon M. M. Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. (1987) 35(2):254–265Link, Google Scholar
• Taillard E. D., Badeau P., Gendreau M., Guertin F., Potvin J.-Y. A new neighborhood structure for the vehicle routing problems with time windows. (1995) . Technical Report CRT-95-66, Centre de Recherche sur les Transports, Université de Montréal, MontréalGoogle Scholar
• Tramontani A. Enhanced mixed integer programming techniques and routing problems. (2009) . Ph.D. thesis, DEIS, Università di Bologna, Bologna, ItalyGoogle Scholar
• Wang X., Regan A. C. Local truckload pickup and delivery with hard time window constraints. Transportation Res. Part B (2002) 36(2):97–112Crossref, Google Scholar
• Wang X., Regan A. C. On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints. Comput. Indust. Engrg. (2009) 56(1):161–164Crossref, Google Scholar