农产品物流配送车辆路径优化算法

Mingqi Sun, D. Pang
{"title":"农产品物流配送车辆路径优化算法","authors":"Mingqi Sun, D. Pang","doi":"10.1504/IJADS.2017.10005299","DOIUrl":null,"url":null,"abstract":"This paper aims to handle the problem of vehicle routing optimisation in agricultural products logistics distribution. The vehicle routing optimisation problem is converted to a graph model calculation problem and then the node set of the graph contain depots and customers. The vehicle routing optimisation is to seek an optimal one from all possible paths which consumes least fuels. The main innovation of this paper is to introduce the ant colony algorithm in the vehicle route optimisation problem. In vehicle routing, each ant starts from the depot and goes through several customers and then goes back to the starting point. Furthermore, customers are determined with the pheromone information and multiple pheromone information matrixes are built up. Finally, experimental results demonstrate that our proposed algorithm can significantly reduce fuel cost in agricultural products logistics distribution.","PeriodicalId":216414,"journal":{"name":"Int. J. Appl. Decis. Sci.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Vehicle routing optimisation algorithm for agricultural products logistics distribution\",\"authors\":\"Mingqi Sun, D. Pang\",\"doi\":\"10.1504/IJADS.2017.10005299\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper aims to handle the problem of vehicle routing optimisation in agricultural products logistics distribution. The vehicle routing optimisation problem is converted to a graph model calculation problem and then the node set of the graph contain depots and customers. The vehicle routing optimisation is to seek an optimal one from all possible paths which consumes least fuels. The main innovation of this paper is to introduce the ant colony algorithm in the vehicle route optimisation problem. In vehicle routing, each ant starts from the depot and goes through several customers and then goes back to the starting point. Furthermore, customers are determined with the pheromone information and multiple pheromone information matrixes are built up. Finally, experimental results demonstrate that our proposed algorithm can significantly reduce fuel cost in agricultural products logistics distribution.\",\"PeriodicalId\":216414,\"journal\":{\"name\":\"Int. J. Appl. Decis. Sci.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Appl. Decis. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJADS.2017.10005299\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Appl. Decis. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJADS.2017.10005299","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文旨在研究农产品物流配送中车辆路径优化问题。将车辆路径优化问题转化为图模型计算问题,图的节点集包含仓库和客户。车辆路径优化就是从所有可能的路径中寻找一条消耗燃料最少的最优路径。本文的主要创新点是将蚁群算法引入到车辆路线优化问题中。在车辆路线中,每只蚂蚁从仓库出发,经过几个客户,然后回到起点。利用信息素信息确定客户,建立多个信息素信息矩阵。最后,实验结果表明,该算法可以显著降低农产品物流配送中的燃料成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Vehicle routing optimisation algorithm for agricultural products logistics distribution
This paper aims to handle the problem of vehicle routing optimisation in agricultural products logistics distribution. The vehicle routing optimisation problem is converted to a graph model calculation problem and then the node set of the graph contain depots and customers. The vehicle routing optimisation is to seek an optimal one from all possible paths which consumes least fuels. The main innovation of this paper is to introduce the ant colony algorithm in the vehicle route optimisation problem. In vehicle routing, each ant starts from the depot and goes through several customers and then goes back to the starting point. Furthermore, customers are determined with the pheromone information and multiple pheromone information matrixes are built up. Finally, experimental results demonstrate that our proposed algorithm can significantly reduce fuel cost in agricultural products logistics distribution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信