Abstract:

The logistics distribution VRP, which is a typical NPhard problem, is a hot topic in the combinatorial optimization field at present. Based on the analysis about VRP, a mathematical model is built. Aiming at solving the vehicle routing problem, the paper puts forward a combinatorial optimization algorithm of ant colony and genetics in order to gain  optimization. The combinatorial optimization algorithm adopts the ant colony algorithm to gain local optimization solution, and then makes use of the genetic algorithm which reserves some elitist genetic sense units that can steadily pass down to the son generation to optimize the local optimization solution for gaining a  global optimization solution. The experimental results show that the combination optimization algorithm is efficient in solving VRP, and the optimization efficiency of the improved algorithm is superior to that of a single algorithm such as the ant colony algorithm or the genetic algorithm.

Key words: vehicle routing problem;combination optimization algorithm;ant colony algorithm;genetic algorithm;route optimization