车辆路径问题的一种改进的节省方法

Wang Xing, Zhao Shu-zhi, Chu Hao, Li Yan
{"title":"车辆路径问题的一种改进的节省方法","authors":"Wang Xing, Zhao Shu-zhi, Chu Hao, Li Yan","doi":"10.1109/CCSSE.2016.7784340","DOIUrl":null,"url":null,"abstract":"The Clarke and Wright's savings method is a classical and widely used heuristics for the Vehicle routing problem(VRP). It is an effective method which reaches a reasonably good solution for small and medium size problems. For large-scale VRP, more complex heuristics are developed by different scholars. In this paper, an improved savings method has been proposed based on modification the rules of forming new links during iteration. The improved savings method offers a better solution than the classical savings method in the given example. Numerical experiments are conducted to test the effectiveness of the algorithm. The result shows that the improved savings method offers a better solution than classical savings method in about 75 percent situation in every 1000 numerical experiments.","PeriodicalId":136809,"journal":{"name":"2016 2nd International Conference on Control Science and Systems Engineering (ICCSSE)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"An improved savings method for vehicle routing problem\",\"authors\":\"Wang Xing, Zhao Shu-zhi, Chu Hao, Li Yan\",\"doi\":\"10.1109/CCSSE.2016.7784340\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Clarke and Wright's savings method is a classical and widely used heuristics for the Vehicle routing problem(VRP). It is an effective method which reaches a reasonably good solution for small and medium size problems. For large-scale VRP, more complex heuristics are developed by different scholars. In this paper, an improved savings method has been proposed based on modification the rules of forming new links during iteration. The improved savings method offers a better solution than the classical savings method in the given example. Numerical experiments are conducted to test the effectiveness of the algorithm. The result shows that the improved savings method offers a better solution than classical savings method in about 75 percent situation in every 1000 numerical experiments.\",\"PeriodicalId\":136809,\"journal\":{\"name\":\"2016 2nd International Conference on Control Science and Systems Engineering (ICCSSE)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 2nd International Conference on Control Science and Systems Engineering (ICCSSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCSSE.2016.7784340\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 2nd International Conference on Control Science and Systems Engineering (ICCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCSSE.2016.7784340","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

克拉克和赖特的节省法是求解车辆路径问题的一种经典的、应用广泛的启发式方法。这是一种有效的方法,可以较好地解决中小型问题。对于大规模VRP,不同学者开发了更复杂的启发式算法。本文提出了一种改进的节省方法,该方法基于修改迭代过程中形成新链接的规则。在给定的例子中,改进的储蓄方法比传统的储蓄方法提供了更好的解决方案。通过数值实验验证了该算法的有效性。结果表明,在每1000次数值实验中,改进的节约方法在约75%的情况下比经典节约方法有更好的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An improved savings method for vehicle routing problem
The Clarke and Wright's savings method is a classical and widely used heuristics for the Vehicle routing problem(VRP). It is an effective method which reaches a reasonably good solution for small and medium size problems. For large-scale VRP, more complex heuristics are developed by different scholars. In this paper, an improved savings method has been proposed based on modification the rules of forming new links during iteration. The improved savings method offers a better solution than the classical savings method in the given example. Numerical experiments are conducted to test the effectiveness of the algorithm. The result shows that the improved savings method offers a better solution than classical savings method in about 75 percent situation in every 1000 numerical experiments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信