Heuristic methods for vehicle routing problem with time windows

Artificial Intelligence in Engineering - Tập 15 - Trang 281-295 - 2001
K.C Tan1, L.H Lee2, Q.L Zhu1, K Ou1
1Department of Electrical and Computer Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore, Singapore 119260
2Department of Industrial and Systems Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore, Singapore 119260

Tài liệu tham khảo

Blanton Jr JL, Wainwright RL. Multiple vehicle routing with time and capacity constraints using genetic algorithms. In: Proceedings of the Fifth International Conference on Genetic Algorithms, 1993. Eilon, 1971 Fisher ML, Jornsten KO, Madsen OBG. Vehicle routing with time windows. Working Paper, 1992. Fisher ML. Vehicle routing, Handbooks in operations research and management science, vol. 8. Amsterdam, New York: Elsevier, 1995 Gendreau, 1994, A Tabu search heuristic for the vehicle routing problem, Mgmt Sci, 40, 1276, 10.1287/mnsc.40.10.1276 Glover, 1997 Holland, 1975 Kirkpatrick, 1983, Optimization by simulated annealing, Science, 20, 671, 10.1126/science.220.4598.671 Kohl N, Madson O. An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Working Paper, 1995. Kolen AWJ, Kan A.H.G.R., Trienekens HWJM. Vehicle routing with time windows Oper Res 1987;35:266–274. Metropolis, 1953, Equations of state calculations by fast computing machines, J Chem Phys, 21, 1087, 10.1063/1.1699114 Oliver IM, Smith DJ, Holland JRC. A study of permutation crossover operations on the traveling salesman problem. In: Proceedings of the Fourth International Conference on Genetic Algorithms, 1991. Osman IH, Christofides N. Simulated annealing and descent algorithms for capacitated clustering problem. Research Report. Imperial College, University of London, 1989. Osman, 1993, Meta-strategy simulated annealing and Tabu search algorithms for the vehicle routing problem, Annu Oper Res, 41, 777 Potvin, 1996, The vehicle routing problem with time windows. Part I. Tabu search, INFORMS J Comput, 8, 158, 10.1287/ijoc.8.2.158 Prinetto P, Rebaudengo M, Sonza Reorda M. Hybrid genetic algorithms for the traveling salesman problem. In: Proceedings of the Fifth International Conference on Genetic Algorithms, 1993. Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. Working Paper, 1998. Solomon, 1987, Algorithms for vehicle routing and scheduling problems with time window constraints, Oper Res, 35, 254, 10.1287/opre.35.2.254 Taillard, 1993, Parallel iterative search methods for vehicle routing problems, Networks, 23, 661, 10.1002/net.3230230804 Thangiah SR, Osman IH, Sun T. Algorithms for the vehicle routing problems with time deadlines. Working Paper, 1992. Thangiah SR, Osman IH, Sun T. Hybrid genetic algorithm, simulated annealing and Tabu search methods for vehicle routing problems with time windows. Technical Report SRU-CpSc-TR-94-27. Computer Science Department, Slippery Rock University, 1994. Thangiah SR. An adaptive clustering method using a geometric shape for vehicle routing problems with time windows. In: Proceedings of the Sixth International Conference on Genetic Algorithms, 1995. Thangiah SR. Vehicle routing with time windows using genetic algorithms. Working Paper, 1995. Willard JAG. Vehicle routing using R-optimal Tabu search. MSc Thesis. London: Management School, Imperial College, 1989. Desrochers M, Desrosier J, Solomon M. A new optimization algorithm for vehicle routing problems with time windows. Oper Res 1992;40:342–355