基于混合启发式算法的同时取货和送货车辆路径问题

Changshi Liu, Qiaomei Tang
{"title":"基于混合启发式算法的同时取货和送货车辆路径问题","authors":"Changshi Liu, Qiaomei Tang","doi":"10.1109/ICLSIM.2010.5461201","DOIUrl":null,"url":null,"abstract":"The vehicle routing problem with simultaneous delivery and pick-up service (VRPSPD) was considered in this paper. A hybrid heurictics was proposed to determine the optimal set of routes to totally satisfy both the delivery and pick-up demand of the customer population. An extensive numerical experiment was performed on benchmark problem instances available in literature. It is found that the proposed approach gives good results compared to the existing algorithms.","PeriodicalId":249102,"journal":{"name":"2010 International Conference on Logistics Systems and Intelligent Management (ICLSIM)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A hybrid heuristics for vehicle routing problem with simultaneous pickup and delivery service\",\"authors\":\"Changshi Liu, Qiaomei Tang\",\"doi\":\"10.1109/ICLSIM.2010.5461201\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The vehicle routing problem with simultaneous delivery and pick-up service (VRPSPD) was considered in this paper. A hybrid heurictics was proposed to determine the optimal set of routes to totally satisfy both the delivery and pick-up demand of the customer population. An extensive numerical experiment was performed on benchmark problem instances available in literature. It is found that the proposed approach gives good results compared to the existing algorithms.\",\"PeriodicalId\":249102,\"journal\":{\"name\":\"2010 International Conference on Logistics Systems and Intelligent Management (ICLSIM)\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Logistics Systems and Intelligent Management (ICLSIM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICLSIM.2010.5461201\",\"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 International Conference on Logistics Systems and Intelligent Management (ICLSIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICLSIM.2010.5461201","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

研究了具有同时送货和取货服务的车辆路径问题。提出了一种混合启发式算法来确定最优路线集,以完全满足客户群体的送货和取件需求。在文献中已有的基准问题实例上进行了广泛的数值实验。结果表明,与现有算法相比,该方法具有较好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A hybrid heuristics for vehicle routing problem with simultaneous pickup and delivery service
The vehicle routing problem with simultaneous delivery and pick-up service (VRPSPD) was considered in this paper. A hybrid heurictics was proposed to determine the optimal set of routes to totally satisfy both the delivery and pick-up demand of the customer population. An extensive numerical experiment was performed on benchmark problem instances available in literature. It is found that the proposed approach gives good results compared to the existing algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信