Abstract

Vehicle Routing Problem(VRP) is an important problem in logistic system. Because of its NP-hard property, it is difficult to get the optimal solution when the constrains are more. Aiming at the problem of logistics distribution vehicle routing optimization, this paper provide a composite algorithm based on the K-means clustering and the Artificial Fish-Swarm Algorithm for the vehicle routing optimization(KMAFA). The results indicate that the algorithm can reduce the input of the algorithm and improve the converging speed. The computational result shows that the results of composite algorithm for VRP are competitive.

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 call

Disclaimer: 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.