Improved cross-removing ant colony algorithm for vehicle routing problem

摘要

To solve path crossing problem of ant colony algorithm for vehicle routing problem (VRP), algorithms for removing crosses in and between branch circuits were proposed, based on convex hull principle and the principle of line intersection judgment. The main ideas of the algorithms were analyzed in detail and solving VRP on computer was achieved. The 21 cities’ vehicle routing problem was simulated by the improved cross-removing ant colony algorithm. The result shows that the total path length is 846.78 km, which is shorter than the results of other algorithms. And it also shows that this algorithm has a stronger ability of finding better solutions.