Simulated annealing metaheuristics for the vehicle routing problem with time windows

E. Baker and J. Schaffer, Solution improvement heuristics for the vehicle routing and scheduling problem with time window constraints, Amer. J. Math. Manag. Sci. 6 (1986) 261–300.

E. Bonomi and J.L. Lutton, The asymptotic behavior of quadratic sum assignment problems: A statistical mechanics approach, Euro. J. Oper. Res. 26 (1986) 295–300.

V. Cerny, Thermodynamic approach to the traveling salesman problem, J. Optim. Theory Appl. 45 (1985) 41–51.

D.T. Connolly, An improved annealing scheme for the QAP, Euro. J. Opér. Res. 46 (1990) 93–100.

N. Christofides and J. Beasley, The period routing problem, Networks 14 (1984) 237–246.

M. Desrochers, J. Desrosiers and M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Oper. Res. 40 (1992) 342–354.

M. Desrochers, J.K. Lenstra, J.K. Savelsberg and F. Soumis, Vehicle routing with time windows: Optimization and approximation, in:Vehicle Routing: Methods and Studies, ed. B.L. Golden and A.A. Assad. (North-Holland, Amsterdam, 1988), pp. 65–84.

M. Fisher and R. Jaikumar, A generalized assignment heuristic for vehicle routing, Networks 11 (1981) 109–124.

M. Fisher K.O. Jörnsten and O.B.G. Madsen, Vehicle routing with time windows, Research Report 4C/1991, IMSOR, Technical University of Denmark, DK-2800 Lyngby, Denmark (1991).

T. Friesz, H.-J. Cho, N. Mehta, R. Tobin and G. Anandalingam, A simulated annealing approach to the network design problem with variational inequality constraints, Transp. Sci. 26 (1992) 18–26.

F. Glover, Future paths for integer programming and links to artificial intelligence, Comp. Oper. Res. 5 (1986) 533–549.

F. Glover, Tabu search, Part 1, ORSA J. Comp. 1 (1990) 190–206.

F. Glover, Tabu search: A tutorial, Interfaces 20 (1990) 74–94.

F. Glover, Tabu search, Part 2, ORSA J. Comp. 2 (1991) 4–32.

F. Glover and M.M. Laguna, Tabu search, in:Modern Heuristic Techniques for Combinatorial Problems, ed. C.R. Reeves (1993) pp. 70–150.

F. Glover, E. Taillard and D. de Werra, A user's guide to tabu search, Ann. Oper Res. 40 (1993) 3–30.

D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation: Part I, Graph partitioning, Oper. Res. 37 (1989) 865–892.

D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation: Part II, Graph coloring and number partitioning, Oper. Res. 39 (1991) 378–406.

S. Kirkpatrick, D.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671–680.

G. Kontoravdis and J. Bard, Improved heuristics for the vehicle routing problems with time windows, Working Paper, Operations Research Group, The University of Texas at Austin (1992).

Y.A. Koskosidis, W.B. Powell and M.M. Solomon, An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints, Transp. Sci. 26 (1992) 69–85.

M.M. Laguna and F. Glover, Bandwidth packing: A tabu search approach, Manag. Sci. 39 (1993) 492–500.

H. Matsuo, C. Suh and R. Sullivan, A controlled search simulated annealing method for the single machine weighted tardiness problems, Ann. Oper. Res. 21 (1989) 85–108.

H. Matsuo, C. Suh and R. Sullivan, A controlled search simulated annealing method for the general job shop scheduling problem, Working Paper, Graduate School of Business, University of Texas at Austin (1987).

N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller and E. Teller, Equation of state calculation by fast computing machines, J. Chem. Phys. 21 (1953) 1087–1091.

I. Or, Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking, Ph.D. Thesis, Department of Industrial Engineering and Management Sciences, Northwestern University (1976).

I.H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems, Ann. Oper. Res. 40 (1993) 421–452.

J.Y. Potvin and J.M. Rousseau, A parallel route building algorithm for the vehicle routing and scheduling problem with time windows, Euro. J. Oper. Res. 66 (1993) 331–340.

R. Russell, An effective heuristic for theM-tour traveling salesman problem with some side conditions, Oper. Res. 25 (1977) 517–524.

R. Russell, Hybrid heuristics for the vehicle routing problem with time windows, Transp. Sci. 29 (1995) 156–166.

M. Savelsbergh, Local search in routing problems with time windows, Ann. Oper. Res. 4 (1985) 285–305.

M. Solomon, Algorithms for the vehicle routing and cheduling problem with time window constraints, Oper. Res. 35 (1987) 254–265.

M. Solomon and J. Desrosiers, Time window constrained routing and scheduling problems, Transp. Sci. 22 (1988) 1–13.

M.M. Solomon, E.K. Baker and J.R. Schaffer, Vehicle routing and scheduling problems with time window constraints: Efficient implementations of solution improvement procedures, in:Vehicle Routing: Methods and Studies, ed. B.L. Golden and A.A. Assad (North-Holland, Amsterdam, 1985), pp. 85–105.

E. Taillard, Robust tabu search for the quadratic assignment problem, Parallel Comp 17 (1991) 443–455.

S.R. Thangiah, K.E. Nygard and P.L. Juell, GIDEON: A genetic algorithm system for vehicle routing problems with time windows,Proc. 7th IEEE Conf. on Artificial Intelligence Applications, Miami, FL (1991).

S.R. Thangiah, I.H. Osman and T. Sun, Hybrid genetic algorithms, simulated annealing and tabu search methods for the vehicle routing problem with time windows (1994).

P.M. Thompson and H. Psaraftis, Cyclic transfer algorithms for multi-vehicle routing and scheduling problems, Oper. Res. 41 (1993) 935–946.

P.J.M. van Laarhoven and E.H. Aarts,Simulated Annealing: Theory and Applications, (Reidel, Dordrecht, 1987).

M.R. Wilhelm and T.L. Ward, Solving quadratic assignment problems by simulated annealing, IEEE Trans. 19 (1987) 107–119.