Research on Particle Swarm Optimization for Grain Logistics Vehicle Routing Problem

Qifeng Zhang
{"title":"Research on Particle Swarm Optimization for Grain Logistics Vehicle Routing Problem","authors":"Qifeng Zhang","doi":"10.1109/CASE.2009.41","DOIUrl":null,"url":null,"abstract":"Based on traditional vehicle routing problem, grain logistics vehicle routing problem with time windows and the characteristics of grain logistics are fully considered in this paper. A model for grain logistics VRPTM was established, where the aim is to complete the maximum tasks with minimum cost. A PSO algorithm is proposed to solve the grain logistics VRPTW, the comparative experiments were made between PSO and basic GA algorithm, and experimental results manifest that the proposed method is effective and can find optimal solution quickly.","PeriodicalId":294566,"journal":{"name":"2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASE.2009.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Based on traditional vehicle routing problem, grain logistics vehicle routing problem with time windows and the characteristics of grain logistics are fully considered in this paper. A model for grain logistics VRPTM was established, where the aim is to complete the maximum tasks with minimum cost. A PSO algorithm is proposed to solve the grain logistics VRPTW, the comparative experiments were made between PSO and basic GA algorithm, and experimental results manifest that the proposed method is effective and can find optimal solution quickly.
粮食物流车辆路径问题的粒子群优化研究
本文在传统车辆路线问题的基础上,充分考虑了具有时间窗的粮食物流车辆路线问题和粮食物流的特点。以以最小的成本完成最大的任务为目标,建立了粮食物流VRPTM模型。提出了一种粒子群算法求解粮食物流VRPTW问题,并将粒子群算法与基本遗传算法进行了对比实验,实验结果表明,所提方法能够快速找到最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信