A research based on K-means clustering and Artificial Fish-Swarm Algorithm for the Vehicle Routing Optimization

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.