需求和行程时间不确定且同时取货和交货的随机车辆路径问题

Lingjuan Hou, Hong Zhou
{"title":"需求和行程时间不确定且同时取货和交货的随机车辆路径问题","authors":"Lingjuan Hou, Hong Zhou","doi":"10.1109/CSO.2010.38","DOIUrl":null,"url":null,"abstract":"Aiming at the stochastic vehicle routing problems with uncertain demand and travel time and with simultaneous pickups and deliveries, a stochastic programming model is formulated and an improved genetic algorithm is proposed for routes optimization. Self-adaptive mechanism is introduced for amending the fitness value to overcome the premature convergence effectively and to improve the efficiency of the algorithm. The performance of the algorithm is discussed under a variety of problem settings and parameters value by the numerical experiments and sensitivity analysis. Results demonstrate that not only the proposed algorithm obtains even better results, but also it has a good robustness.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Stochastic Vehicle Routing Problem with Uncertain Demand and Travel Time and Simultaneous Pickups and Deliveries\",\"authors\":\"Lingjuan Hou, Hong Zhou\",\"doi\":\"10.1109/CSO.2010.38\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Aiming at the stochastic vehicle routing problems with uncertain demand and travel time and with simultaneous pickups and deliveries, a stochastic programming model is formulated and an improved genetic algorithm is proposed for routes optimization. Self-adaptive mechanism is introduced for amending the fitness value to overcome the premature convergence effectively and to improve the efficiency of the algorithm. The performance of the algorithm is discussed under a variety of problem settings and parameters value by the numerical experiments and sensitivity analysis. Results demonstrate that not only the proposed algorithm obtains even better results, but also it has a good robustness.\",\"PeriodicalId\":427481,\"journal\":{\"name\":\"2010 Third International Joint Conference on Computational Science and Optimization\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Third International Joint Conference on Computational Science and Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSO.2010.38\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Third International Joint Conference on Computational Science and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSO.2010.38","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

针对需求和行程时间不确定、同时上下车的随机车辆路径问题,建立了随机规划模型,提出了一种改进的遗传算法进行路径优化。引入自适应机制对适应度值进行修正,有效克服了算法的过早收敛,提高了算法的效率。通过数值实验和灵敏度分析,讨论了该算法在各种问题设置和参数值下的性能。结果表明,该算法不仅取得了较好的效果,而且具有较好的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Stochastic Vehicle Routing Problem with Uncertain Demand and Travel Time and Simultaneous Pickups and Deliveries
Aiming at the stochastic vehicle routing problems with uncertain demand and travel time and with simultaneous pickups and deliveries, a stochastic programming model is formulated and an improved genetic algorithm is proposed for routes optimization. Self-adaptive mechanism is introduced for amending the fitness value to overcome the premature convergence effectively and to improve the efficiency of the algorithm. The performance of the algorithm is discussed under a variety of problem settings and parameters value by the numerical experiments and sensitivity analysis. Results demonstrate that not only the proposed algorithm obtains even better results, but also it has a good robustness.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信