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

Zhao Chen
{"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}
引用次数: 2

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于改进蚁群算法的多中心路线规划研究
车辆路径问题(VRP)是动态规划中的一个热点问题。它在实体经济和社会中有着广泛的应用。即一个配送中心有几辆满载货物的卡车,卡车将货物配送到配送中心的多个需求点,要求总成本最低的优化。本文采用改进的蚁群算法求解多中心VRP问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Visible and infrared image fusion based on visual saliency detection Sponsors DCABES 2020 Computer Vision based Automatic Power Equipment Condition Monitoring and Maintenance: A Brief Review Heuristic Moment Matching based Scenario Generation for Regional Energy Network Planning considering the Stochastic Generation and Demands Some New Attempts to Process Biological Data
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1