Research on Multi-Center Route Planning based on improved Ant Colony algorithm

2020 19th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)(2020)

引用 3|浏览1
暂无评分
摘要
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.
更多
查看译文
关键词
Ant colony algorithm,simulated annealing algorithm,multi-center,VRP,K-means
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要