Vehicle Routing Problem (VRP) is a hot issue in dynamic programming. It has a wide range of applications in the real economy and society. That is, a distribution center has several trucks full of goods, and trucks distribute goods to many demand points of the distribution center, requiring the optimization of the lowest total cost. In this paper, the improved ant colony algorithm is used to solve the multi-center VRP problem.
Paper
Full text
Research on Multi-Center Route Planning based on improved Ant Colony algorithm
Semantic Scholar · Computer Science · 2020
Abstract
Vehicle Routing Problem (VRP) is a hot issue in dynamic programming. It has a wide range of applications in the real economy and society. That is, a distribution center has several trucks full of goods, and trucks distribute goods to many demand points of the distribution center, requiring the optimization of the lowest total cost. In this paper, the improved ant colony algorithm is used to solve the multi-center VRP problem.