基于聚类算法和蚁群算法的数字化公司配送中心选址与路径优化研究

Wang Jiaojiao, Li Yueyu, Cao Congcong
{"title":"基于聚类算法和蚁群算法的数字化公司配送中心选址与路径优化研究","authors":"Wang Jiaojiao, Li Yueyu, Cao Congcong","doi":"10.1109/ICITM48982.2020.9080377","DOIUrl":null,"url":null,"abstract":"Aiming at the complex problem of logistics distribution, in order to achieve the shortest path and the least total cost, this paper analyzes and designs the logistics distribution network from the two aspects of distribution center location and path optimization. Firstly, the improved clustering algorithm is used to determine the distribution center, the corresponding supply point and distribution point of each distribution center, then the ant colony algorithm is used to optimize the path, and finally the distribution center and the corresponding distribution path are determined. In the end of this paper, the case analysis is carried out to find out the best distribution center and the shortest path, which gets an optimized distribution network, so as to achieve the purpose of the lowest cost.","PeriodicalId":176979,"journal":{"name":"2020 9th International Conference on Industrial Technology and Management (ICITM)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Study on Location and Route Optimization of Distribution Center of a Digital Company Based on Clustering Algorithm and Ant Colony Algorithm Method\",\"authors\":\"Wang Jiaojiao, Li Yueyu, Cao Congcong\",\"doi\":\"10.1109/ICITM48982.2020.9080377\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Aiming at the complex problem of logistics distribution, in order to achieve the shortest path and the least total cost, this paper analyzes and designs the logistics distribution network from the two aspects of distribution center location and path optimization. Firstly, the improved clustering algorithm is used to determine the distribution center, the corresponding supply point and distribution point of each distribution center, then the ant colony algorithm is used to optimize the path, and finally the distribution center and the corresponding distribution path are determined. In the end of this paper, the case analysis is carried out to find out the best distribution center and the shortest path, which gets an optimized distribution network, so as to achieve the purpose of the lowest cost.\",\"PeriodicalId\":176979,\"journal\":{\"name\":\"2020 9th International Conference on Industrial Technology and Management (ICITM)\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 9th International Conference on Industrial Technology and Management (ICITM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICITM48982.2020.9080377\",\"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 9th International Conference on Industrial Technology and Management (ICITM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITM48982.2020.9080377","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

针对物流配送的复杂问题,从配送中心选址和路径优化两个方面对物流配送网络进行了分析和设计,以实现最短路径和最小总成本。首先利用改进的聚类算法确定配送中心、每个配送中心对应的补给点和配送点,然后利用蚁群算法对路径进行优化,最后确定配送中心和相应的配送路径。本文最后通过案例分析,找出最佳配送中心和最短路径,从而得到一个优化的配送网络,以达到成本最低的目的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Study on Location and Route Optimization of Distribution Center of a Digital Company Based on Clustering Algorithm and Ant Colony Algorithm Method
Aiming at the complex problem of logistics distribution, in order to achieve the shortest path and the least total cost, this paper analyzes and designs the logistics distribution network from the two aspects of distribution center location and path optimization. Firstly, the improved clustering algorithm is used to determine the distribution center, the corresponding supply point and distribution point of each distribution center, then the ant colony algorithm is used to optimize the path, and finally the distribution center and the corresponding distribution path are determined. In the end of this paper, the case analysis is carried out to find out the best distribution center and the shortest path, which gets an optimized distribution network, so as to achieve the purpose of the lowest cost.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信