A vehicle routing problem solved by using a hybrid genetic algorithm

Computers and Industrial Engineering

Volumn 53, Issue 4, 2007, Pages 680-692

  Jeon, Geonwook ^a   Leep, Herman R ^b   Shim, Jae Young ^c  

^a Korea National Defense University   (South Korea)

^b University of Louisville ^*  (United States)

^c The 26th Division   (South Korea)

Author keywords

Double trips; Heterogeneous VRP; Hybrid genetic algorithm; Multiple depots

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC PROGRAMMING; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; PROBLEM SOLVING;

FLOAT MUTATION RATE; HETEROGENEOUS VEHICLES; HYBRID GENETIC ALGORITHM (HGA);

VEHICLE ROUTING;

EID: 35348997117     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2007.06.031     Document Type: Article

References (28)

1. Alba, E., & Dorronsoro, B. (2004). Solving the vehicle routing problem by using cellular genetic algorithms. In Lecture notes in computer science (Vol. 3004, pp. 11-20).
2. Barabarosoglu G., and Ozgur D. A tabu search algorithm for the vehicle routing problem. Computers and Operations Research 26 (1999) 255-270
3. Blanton, J. L., & Wainwright, R. L. (1993). Multiple vehicle routing with time and capacity constraints using genetic algorithms. In Proceedings of the fifth international conference on genetic algorithms (pp. 452-459), Los Altas, CA.
4. Bodin L.D., Golden B., and Bender A. The state of the art in the routing and scheduling of vehicle and crews. Computers and Operations Research 10 (1983) 79-116
5. Bullnheimer B., Hartl R.F., and Strauss C. An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 89 (1999) 319-328
6. Danzig G.B., and Ramser J.H. The truck dispatching problem. Management Science 6 (1959) 80-91
7. Eilon S., Watson-Gandy C.D.T., and Christofides N. Distribution management: Mathematical modeling and practical analysis (1971), Griffin, London
8. Fisher M.L. Optimal solution of vehicle routing problems using minimum K-trees. Operation Research 42 (1994) 626-642
9. Gambardella L.M., Taillard E., and Agazzi G. A multiple ant colony system for vehicle routing problems with time windows. In: Corne D., Dorigo M., and Glover F. (Eds). New ideas in optimization (1999), McGraw-Hill, New York 63-76
10. Gen M., and Cheng R. Genetic algorithms & engineering design (1997), A Wiley-Interscience, New York
11. Gendreau M., Hertz A., and Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 40 (1994) 1276-1290
12. Hiquebran D.T., Alfa A.S., Shapiro A., and Gittoes D.H. A revised simulated annealing and cluster-first route-second algorithm applied to the vehicle routing problem. Engineering Optimization 22 (1994) 77-107
13. Laporte G. The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research 59 (1992) 345-358
14. Lenstra J.K., and Rinnooy K. Complexity of vehicle routing and scheduling problems. Networks 11 (1981) 221-227
15. Magnanti T.L., and Wong R.T. Accelerating benders decomposition-algorithmic enhancement and model selection criteria. Operations Research 29 3 (1981) 464-484
16. Michalewicz Z. Genetic algorithm + data structure = evolution programs. 2nd ed. (1994), Springer-Verlag, New York
17. Miller C., Tucker A., and Zelmin R. Integer programming formulation of traveling salesman problems. Journal of the Association of Computing Machinery 7 (1960) 326-332
18. Osman I.H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Operations Research 41 (1993) 421-451
19. Potvin J.Y., and Bengio S. The vehicle routing problem with time windows - Part II: Genetic search. INFORMS. Journal on Computing 8 (1996) 165-172
20. Potvin J.Y., Dube D., and Robillard C. A hybrid approach to vehicle routing using neural networks and genetic algorithms. Applied Intelligence 6 (1996) 241-252
21. Potvin J.Y., Duhamel C., and Guertin F. A genetic algorithm for vehicle routing with backhauling. Applied Intelligence 6 (1996) 345-355
22. Rego C., and Roucairol C. A parallel tabu search algorithm using ejection chains for the vehicle routing problem. In: Osman I., and Kelly J. (Eds). Meta-heuristics: Theory and applications (1996), Kluwer, Boston
23. Salhi S., Thangiah S.R., and Rahman F. A genetic clustering method for the multi-depot vehicle routing problem. In: Smith G.D., Steel N.C., and Albrecht R.F. (Eds). ICANNGA '97 Vienna (1998), Springer, New York 234-237
24. Schmitt, L. J. (1994). An empirical computational study of genetic algorithms to solve order-based problems: An emphasis on the TSP and the VRP with time constraints. Ph.D. dissertation. Fogelman College of Business and Economics, University of Memphis.
25. Shin H.W., and Kang M.G. Heuristic method by multi-trip vehicle routing problem. Journal of Korea Industrial Management 14 (1991) 141-147
26. Thangiah, S. R., & Nygard, P.L. (1992). School bus routing using genetic algorithms. In Proceedings of the SPIE conference on applications of artificial intelligence X: Knowledge based systems (pp. 387-397), Orlando, FL.
27. Thangiah, S. R., Nygard, P. L., & Juell, P. L., GIDEON. (1991). A genetic algorithm system for vehicle routing with time windows. In Proceedings of the seventh IEEE conference on artificial intelligence applications (pp. 322-328), Miami, FL.
28. Thangiah S.R., Vinayagamoorthy R., and Gubbi A.V. Vehicle routing with time deadlines using genetic and local algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms (1993), Morgan Kaufmann, Los Altas CA 506-515