Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods

Journal of King Saud University - Science

Volumn 22, Issue 3, 2010, Pages 123-131

  El Sherbeny, Nasser A ^a  

^a Assiut Branch   (Egypt)

Author keywords

Exact methods; Heuristic; Metaheuristic; VRPTW

Indexed keywords

EID: 77954315238     PISSN: 10183647     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jksus.2010.03.002     Document Type: Article

References (40)

1. Agarwal Y., Mathur K., Salki H. A set-partitioning-based exact algorithm for the vehicle routing problem. Networks 1989, 19:731-749.
2. Antes, J., Derigs, U., 1995. A New Parallel Tour Construction Algorithm for the Vehicle Routing Problem with Time Windows. Technical Report, Lehrstuhl fur Wirtschaftsinformatik und Operations Research, Universitat zu Koln.
3. Badeau, P., Gendreau, M., Guertin, F., Potvin, J., Taillard, E., 1995. A Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows. Technical Report, CRT-95-84, Centre de recherche sur les transports, Montréal.
4. Baker E., Schaffer J. Solution improvement heuristics for the vehicle routing and scheduling problem with time windows constraints. American Journal of Mathematics and Management Sciences 1989, 6(3,4):261-300.
5. Chiang W., Russell R. Simulated annealing metaheuristics for the vehicle routing problem with time windows. Annals of Operations Research 1996, 63:3-27.
6. Christofides N., Beasley N. The period routing problem. Networks 1984, 14:237-241.
7. Clarke G., Wright W. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 1964, 12:568-581.
8. Crainic G., Laporte G. Fleet Management and Logistics 2000, Kluwer Academic Publishers.
9. Desaulniers G., Lavigne J., Soumis F. Multi-depot vehicle scheduling problem with time windows and waiting costs. European Journal of Operation Research 1997, 111:479-494.
10. Desrochers M., Desrosiers J., Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 1992, 40(2):342-354.
11. Desrosiers J., Soumis F., Desrosiers M. Routing with time windows by column generation. Networks 1984, 14(4):545-565.
12. Dumes Y., Desrosiers J., Soumis F. The pickup and delivery problem with time windows. European Journal of Operation Research 1991, 54:7-21.
13. El-Sherbeny, N., 2001. Resolution of a Vehicle Routing Problem with Multiobjective Simulated Annealing Method. Ph.D. Dissertation, Faculte Polytechnique de Mons, Belgique.
14. El-Sherbeny, N., Tuyttens, D., 2001. Optimization multicriteria of routing problem. Troisieme Journee de Travail sur la Programming Mathematique Multi-objective, Faculte Polytehnique de Mons, Belgique.
15. Fisher M. Optimal solution of vehicle routing problem using minimum k-trees. Operations Research 1994, 42(4):626-642.
16. Fisher M., Jornsteen K., Madsen O. Vehicle routing with time windows: two optimization algorithms. Operations Research 1997, 45(3):488-492.
17. Garcia B., Potvin J., Rousseau J. A parallel implementation of the tabu search heuristic for vehicle routing problems with time windows constraints. Computers and Operations Research 1994, 21(9):1025-1033.
18. Gillett B., Miller L. A heuristic algorithm for the vehicle dispatch problem. Operation Research 1974, 22:340-349.
19. Glover F. Tabu search. Part 1, ORSA. Journal on Computing 1989, 1(3):190-206.
20. Glover F., Kelly P., Laguna M. Genetic algorithms and Tabu search: hybrids for optimizations. Computer Operation Research 1995, 22(1):111-134.
21. Goldbeerg E. Genetic Algorithms in Search. Optimization and Machine Learning 1989, Addison-Wesley, Reading, MA.
22. Holland H. Adaptation in Natural and Artificial Systems 1975, The University of Michigan Press, Ann Arbor, MI.
23. Kohl N., Madsen O. An optimization algorithm for the vehicle routing problem with time windows based on lagrangean relaxation. Operations Research 1997, 45(3):395-406.
24. Kolen A., Rinnooy Kan A., Trienkens H. Vehicle routing problem with time windows. Operation Research 1987, 35:266-273.
25. Koskosidis Y., Powell W., Solomon M. An optimization-based heuristic for vehicle routing and scheduling with soft time windows constraints. Transportation Science 1992, 26:57-69.
26. Landeghem A. A bi-criteria heuristic for the vehicle routing problem with time windows. European Journal of Operational Research 1988, 36:217-226.
27. Lenstra J., Rinnooy K. Complexity of vehicle routing and scheduling problems. Networks 1981, 11:221-227.
28. Lie C., Simchi-Levi D. Worst-case analysis of heuristics for multi-depot capacitated vehicle routing problems. Journal on Computing 1990, 2:64-73.
29. Osman I. Metastrategy simulated annealing and tabu search heuristic algorithms for the vehicle routing problem. Annals of Operations Research 1993, 41:421-434.
30. Pirlot M. General local search methods. European Journal of Operational 1996, 92:493-511.
31. Potvin J., Rousseau J. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research 1993, 66:331-340.
32. Potvin J., Rousseau J. An exchange heuristic for routing problems with time windows. Journal of Operational Research Society 1995, 46(12):1433-1446.
33. Reeves C. Modern Heuristic Techniques for Combinatorial Problems 1995, Mc-Greenhill.
34. Russell R. Hybrid heuristics for the vehicle routing problem with time windows. Transportation Science 1995, 29(2):156-166.
35. Schulze J., Fahle T. A parallel algorithm for the vehicle routing problem with time windows constraints. Annals of Operations Research 1999, 86:585-607.
36. Solomon M. Algorithms for the vehicle routing and scheduling problems with time windows constraints. Operations Research 1987, 35(2):254-265.
37. Thamgiah, S., Osman, I., Sun, T., 1995. Metaheuristics for the Vehicle Routing Problem with Time Windows. Technical Report, SUR-CpSc-TR-95-32, Artificial Intelligence and Robotics Laboratory, Computer Science Department, Slippery Rock University, PA.
38. Toth, P., Vigo, D., 2002. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications.
39. Tuyttens D., Liegeois B., Pirlot M., Teghem J., Trauwaert E. Homogeneous grouping of unclear fuel cans through annealing and tabu search. Annals of Operation Research 1994, 50:575-607.
40. Tuyttens, D., Teghem, J., El-Sherbeny, N., 2004. A particular multiobjective vehicle routing problem solved by simulated annealing. Lecture Notes in Economics and Mathematical Systems, vol. 535. Springer-Verlag, Germany, pp. 133-152.