A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows

References

• Baker E. An exact algorithm for the time constrained traveling salesman problem. Oper. Res. (1983) 31:938–945Link, Google Scholar
• Bonomi E., Lutton J. L. The N-city traveling salesman problem: Statistical mechanics methods and Metropolis algorithm. SIAM Rev. (1984) 36:551–568Crossref, Google Scholar
• Carlton W. B., Barnes J. W. Solving the traveling-salesman problem with time windows using tabu search. IEE Trans. (1996) 28:617–629Crossref, Google Scholar
• Cerny V. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. J. Optim. Theory Appl. (1985) 45:41–51Crossref, Google Scholar
• Cheh K., Goldberg J., Askin R. A note on the effect of neighborhood structure in simulated annealing. Comput. Oper. Res. (1991) 18:537–547Crossref, Google Scholar
• Christofides N., Mingozzi A., Toth P. State space relaxation procedures for the computation of bounds to routing problems. Networks (1981) 11:145–164Crossref, Google Scholar
• Coy S. P., Golden B. L., Runger G. C., Wasil E. A. Using experimental design to find effective parameter settings for heuristics. J. Heuristics (2000) 7:77–97Crossref, Google Scholar
• Dowsland K. A., Reeves Colin R. Simulated annealing. Modern Heuristic Techniques for Combinatorial Problems (1993) (Wiley, New York) . Chap. 2Google Scholar
• Dumas Y., Desrosiers J., Gelinas E., Solomon M. M. An optimal algorithm for the traveling salesman problem with time windows. Oper. Res. (1995) 43:367–371Link, Google Scholar
• Focacci F., Lodi A., Milano M. A hybrid exact algorithm for the TSPTW. INFORMS J. Comput. (2002) 14:403–417Link, Google Scholar
• Gendreau M., Hertz A., Laporte G. New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. (1992) 40:1086–1094Link, Google Scholar
• Gendreau M., Hertz A., Laporte G., Stan M. A generalized insertion heuristic for the traveling salesman problem with time windows. Oper. Res. (1998) 46:330–335Link, Google Scholar
• Hadj-Alouane A., Bean J. C. A genetic algorithm for the multiple-choice integer program. Oper. Res. (1997) 45:92–101Link, Google Scholar
• Johnson D., Aragon C., McGeoch L., Schevon C. Optimization by simulated annealing: An experimental evaluation; Part I, Graph partitioning. Oper. Res. (1989) 37:865–892Link, Google Scholar
• Kirkpatrick S., Gelatt C. D., Vecchi M. P. Optimization by simulated annealing. Science (1983) 220:671–680Crossref, Google Scholar
• Langevin A., Desrochers M., Desrosiers J., Gelinas S., Soumis F. A two-commodity flow formulation for the traveling salesman and makespan problems with time windows. Networks (1993) 23:631–640Crossref, Google Scholar
• Metropolis N., Rosenbluth A., Rosenbluth M., Teller A., Teller E. Equation of state calculations by fast computing machines. J. Chemical Phys. (1953) 21:1087–1092Crossref, Google Scholar
• Montgomery D. C.Design and Analysis of Experiments (2001) (Wiley, New York) Google Scholar
• Morse C. Stochastic equipment replacement with budget constraints. (1997) . Ph.D. thesis, University of Michigan, Ann Arbor, MIGoogle Scholar
• Ohlmann J. W., Bean J. C., Henderson S. G. Convergence in probability of compressed annealing. Math. Oper. Res. (2004) 29:837–860Link, Google Scholar
• Pesant G., Gendreau M., Potvin J.-Y., Rousseau J.-M. An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation Sci. (1998) 32:12–29Link, Google Scholar
• Pesant G., Gendreau M., Potvin J.-Y., Rousseau J.-M. On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem. Eur. J. Oper. Res. (1999) 117:253–263Crossref, Google Scholar
• Potvin Jean-Yves, Bengio S. The vehicle routing problem with time windows—Part II: Genetic search. INFORMS J. Comput. (1996) 8:165–172Link, Google Scholar
• Savelsbergh M. W. P. Local search in routing problems with time windows. Ann. Oper. Res. (1985) 4:285–305Crossref, Google Scholar
• Solomon M. M. Algorithms for the vehicle routing and scheduling problems with time windows. Oper. Res. (1987) 35:254–265Link, Google Scholar
• Theodoracatos V., Grimsley J. The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules. Comput. Methods Appl. Mech. Engrg. (1995) 125:53–70Crossref, Google Scholar
• van Laarhoven P. J. M., Aarts E. H. L.Simulated Annealing (1987) (P. Reidel Publishing Co., Dordrecht, The Netherlands) Crossref, Google Scholar
• van Laarhoven P. J. M., Aarts E. H. L., Lenstra J. K. Job shop scheduling by simulated annealing. Oper. Res. (1992) 40:113–125Link, Google Scholar
• Wolfler Calvo R. A new heuristic for the traveling salesman problem with time windows. Transportation Sci. (2000) 34:113–124Link, Google Scholar