基于改进蚁群算法的多中心路线规划研究

2020 19th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES) Pub Date : 2020-10-01 DOI:10.1109/dcabes50732.2020.00016

Zhao Chen

{"title":"基于改进蚁群算法的多中心路线规划研究","authors":"Zhao Chen","doi":"10.1109/dcabes50732.2020.00016","DOIUrl":null,"url":null,"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.","PeriodicalId":351404,"journal":{"name":"2020 19th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Research on Multi-Center Route Planning based on improved Ant Colony algorithm\",\"authors\":\"Zhao Chen\",\"doi\":\"10.1109/dcabes50732.2020.00016\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":351404,\"journal\":{\"name\":\"2020 19th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 19th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/dcabes50732.2020.00016\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 19th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/dcabes50732.2020.00016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

车辆路径问题(VRP)是动态规划中的一个热点问题。它在实体经济和社会中有着广泛的应用。即一个配送中心有几辆满载货物的卡车，卡车将货物配送到配送中心的多个需求点，要求总成本最低的优化。本文采用改进的蚁群算法求解多中心VRP问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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

自引率

0.00%

发文量