The Application of The Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem

摘要

Vehicle Routing Problem (VRP) is one of critical problems in modern logistics service. Due to small batch and dynamic changes of VRP, an effective and fast algorithm solution of VRP is greatly needed. But in traditional Ant Colony Algorithm, the searching speed is slow, and it is easy to fall into the local optimization when solve this problem. In order to overcome these disadvantages, basing on the new hybrid algorithm of Ant Colony Algorithm and Artificial Fish School Algorithm, this paper further improves the Aswarm Degree in the Artificial Fish School Algorithm and proposes the Insertion Point Algorithm to solve the problem rapidly. The simulation results show that the improved algorithm has a better searching ability of global optimization. The improved algorithm is an effective algorithm of solving the VRP optimization problem.