Solving Vehicle Routing Problem Using Ant Colony and Genetic Algorithm
Vehicle routing problem becomes more remarkable with the development of modern logistics. Ant colony and genetic algorithm are combined for solving vehicle routing problem. GA can overcome the drawback of premature and weak exploitation capabilities of ant colony and converge to the global optimal quickly. The performance of the proposed method as compared to those of the genetic-based approaches is very promising.
Keywordsant colony vehicle routing problem genetic algorithm
Unable to display preview. Download preview PDF.
- 1.Dorigo, M.: Optimization, learning and natural algorithms. Ph.D. Thesis, Italy (1992)Google Scholar
- 3.Jian, S., Jian, S., Lin, B.M.T., Hsiao, T.: Ant colony optimization for the cell assignment problem in PCS networks. Computer and Operations Research 33, 1731–1740 (2006)Google Scholar
- 9.Doerner, K.F., Hartl, R.F., Kiechle, G., Lucka, M., Reimann, M.: Parallel Ant Systems for the Capacitated Vehicle Routing Problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol. 3004, pp. 72–83. Springer, Heidelberg (2004)Google Scholar