Vehicle routing problem research based on genetic-ant colony algorithm

Abstract

To resolve vehicle routing problem in logistic field, genetic arithmetic and ant colony arithmetic are often employed, and each runs with merit and defect. In the paper, two algorithm thinking are integrated based on each trait. Firstly a rapid and excellent solution arises in anterior genetic operation, and initial information elements derive from the solution, and then ant colony arithmetic starts. Varietal genetic operation is also introduced to ant computing to avoid immersing into local top. Simulate test prove validity and efficiency of the arithmetic. © 2008 IEEE.