Using genetic algorithms for multi-depot vehicle routing

Studies in Computational Intelligence

Volumn 161, Issue , 2009, Pages 77-99

  Ombuki Berman, Beatrice ^a   Hanshar, Franklin T ^b  

^a BROCK UNIVERSITY   (Canada)

^b UNIVERSITY OF GUELPH   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 51849107315     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-85152-3_4     Document Type: Article

References (45)

1. Aickelin, U., Dowsland, K.A.: An indirect genetic algorithm for a nurse-scheduling problem. Computers and Ops. Res. 31, 761-778 (2004)
2. Alander, J.T.: An indexed bibliography of genetic algorithms in operations research. Technical report series no. 94-1-or, University of Vaasa, Vaasa, Finland (2000)
3. Ball, M.O., Golden, B.L., Assad, A.A., Bodin, L.D.: Planning for truck fleet size in the presence of a common-carrier option. Decis. Sci. 14, 103-120 (1983)
4. Benton, W.C.: Evaluating a modified heuristic for the multiple vehicle scheduling problem. Working paper rs86-14, College of Administration Science, Ohio State University, Columbus, OH (1986)
5. Benton, W.C., Srikar, B.: Experimental study of environmental factors that affect the vehicle routing problem. Journal of Business Logistics 6(1), 66-78 (1987)
6. Cassidy, P.J., Bennett, H.S.: Tramp - a multi-depot vehicle scheduling system. Operational Research Quarterly 23, 151-162 (1972)
7. Chao, I.M., Golden, B.L., Wasil, E.: A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions. Am. J. Math. Mgmt Sci. 13, 371-406 (1993)
8. Christofides, N., Eilon, S.: An algorithm for the vehicle-dispatching problem. Operational Research Quarterly 20, 309-318 (1969)
9. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 46, 93-100 (1964)
10. Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for the period and multidepot vehicle routing problems. Networks 30, 105-119 (1997)
11. Crevier, B., Cordeau, J.F., Laporte, G.: The multi-depot vehicle routing problem with interdepot routes. European Journal of Operational Research 176(2), 756-773 (2007)
12. Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. John Wiley, Chichester (2001)
13. Desrosier, J., Dumas, Y., Solomon, M.M., Soumis, F.: Time constraint routing and scheduling. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Handbooks in Operations Research and Management Science, vol. 8, pp. 35-139. Elsevier Science Publishers, Amsterdam (1995)
14. Filipec, M., Skrlec, D., Krajcar, S.: Darwin meets computers: New approach to multiple depot capacitated vehicle routing problem 1, 421-426 (1997)
15. Filipec, M., Skrlec, D., Krajcar, S.: Genetic algorithm approach for multiple depot capacitated vehicle routing problem solving with heuristic improvements. International Journal of Model ling & Simulation 20, 320-328 (2000)
16. Fogel, D.: EvolutionTry Computation: the fossil record. IEEE Press, New York (1998)
17. Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to The Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
18. Gillett, B.E., Johnson, J.G.: Multi-terminal vehicle-dispatch algorithm. Omega 4, 711-718 (1976)
19. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
20. Golden, B.L., Magnanti, T.L., Nguyen, H.Q.: Implementing vehicle routing algorithms. Networks 7, 113-148 (1977)
21. Golden, B.L.,Wasil, E.: Computerized vehicle routing in the soft drink industry. Operations Research 35, 6-17 (1987)
22. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
23. De Jong, K.A.: An Analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan (1975)
24. Klots, B., Gal, S., Harpaz, A.: Multi-depot and multi-product delivery optimization problem time and service constraints. Ibm israel report 88-315, Science and Technology, Haifa, Israel (1992)
25. Laporte, G.: The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operations Research 59, 345-358 (1992)
26. Laporte, G., Nobert, T., Arpin, D.: Optimal solutions to capacitated multidepot vehicle routing problems. Congressus Numerantium 44, 283-292 (1984)
27. Laporte, G., Nobert, T., Taillefer, S.: Solving a family of multi-depot vehicle routing and location problems. Transportation Science 22, 161-172 (1988)
28. Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of vehicle routing problem with time windows. Networks 11, 221-227 (1981)
29. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Heidelberg (1998)
30. Min, H., Current, J., Schilling, D.: The multiple depot vehicle routing problem with backhauling. Journal of Business Logistics 13, 259-288 (1992)
31. Ombuki, B., Ross, B., Hanshar, F.: Multi-objective genetic algorithms for vehicle routing problems with time windows. Journal of Applied Intelligence 24(1), 17-30 (2006)
32. Palmer, C., Kershenbaum, A.: Representing trees in genetic algorithms. In: Proceedings of the First IEEE International Conference on Evolutionary Computation, NY, pp. 379-384 (1994)
33. Perl, J.: The multi-depot routing allocation problem. American journal of Mathematical and Management Science 7, 8-34 (1987)
34. Perl, J., Daskin, M.S.: A warehouse location-routing problem. Transportation Research 19B, 381-396 (1985)
35. Pooley, J.: Integrated production and distribution facility planning at Ault foods. Interfaces 24, 113-121 (1994)
36. Renaud, J., Laporte, G., Boctor, F.F.: A tabu search heuristic for the multi-depot vehicle routing problem. Computers Ops. Res. 23, 229-235 (1996)
37. Salhi, S., Sari, M.: A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. European J. Op. Res. 103, 95-112 (1997)
38. Salhi, S., Thangiah, S.R., Rahman, F.: A genetic clustering method for the multi-depot vehicle routing problem, 234-237 (1998)
39. Skok, M., Skrlec, D., Krajcar, S.: The genetic algorithm method for multiple depot capacitated vehicle routing problem solving, 520-526 (2000)
40. Skok, M., Skrlec, D., Krajcar, S.: The non-fixed destination multiple depot capacitated vehicle routing problem and genetic algorithms, 403-408 (2000)
41. Thangiah, S.R.N Salhi, S.: Genetic clustering:an adaptive heuristic for the multidepot vehicle routing problem. Applied Artificial Intelligence 15, 361-383 (2001)
42. Tillman, F.A., Cain, T.M.: An upper bound algorithm for the single and multiple terminal delivery problem. Management Science 18, 664-682 (1972)
43. Tillman, F.A.: The multiple terminal delivery problem with probabilistic demands. Transportation Science 3, 192-204 (1969)
44. Bell, W., Dalberto, L., Fisher, M.L., Greenfield, A., Jaikumar, R., Mack, R., Kedia, P., Prutzman, P.: Improving the distribution of industrial gases with an on-line computerized routing and scheduling system. Interfaces 13, 4-22 (1983)
45. Wren, A., Holliday, A.: Computer scheduling of vehicles from one or more depots to a number of delivery points. Operational Research Quarterly 23, 333-344 (1972)