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.
cross-removing ant colony algorithm vehicle routing problem
Jin Xiao Wang Jian Wang Yanyan
School of Transportation Science and EngineeringBeijing University of Aeronautics and AstronauticsBe School of Transportation Science and Engineering Beijing University of Aeronautics and Astronautics
国际会议
哈尔滨
英文
367-371
2011-01-18（万方平台首次上网日期，不代表论文的发表时间）