Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
