A Combining Heuristic Algorithm for the Multi-depot Vehicle Routing Problem with Inter-depot Routes

Tong Zhen, Qiuwen Zhang
{"title":"A Combining Heuristic Algorithm for the Multi-depot Vehicle Routing Problem with Inter-depot Routes","authors":"Tong Zhen, Qiuwen Zhang","doi":"10.1109/JCAI.2009.161","DOIUrl":null,"url":null,"abstract":"The multi-depot vehicle routing problem with inter-depot routes (MDVRPI) is an extension to the classical Vehicle Routing Problem (VRP); it is the major research topics in the supply chain management field. It is an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. In this paper, we propose a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances. The experiment indicates the validity of the technique to MDVRPI with the above-mentioned conditions.","PeriodicalId":373421,"journal":{"name":"IITA International Joint Conference on Artificial Intelligence","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"60","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IITA International Joint Conference on Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCAI.2009.161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 60

Abstract

The multi-depot vehicle routing problem with inter-depot routes (MDVRPI) is an extension to the classical Vehicle Routing Problem (VRP); it is the major research topics in the supply chain management field. It is an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. In this paper, we propose a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances. The experiment indicates the validity of the technique to MDVRPI with the above-mentioned conditions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多车场车辆路线问题与车场间路线的联合启发式算法
带库间路线的多车场车辆路线问题(MDVRPI)是对经典车辆路线问题(VRP)的扩展;它是供应链管理领域的主要研究课题。它是多车场车辆路线问题的延伸,车辆可能在沿途的中间车场进行补给。本文提出了一种结合自适应记忆原理、子问题解的禁忌搜索法和整数规划的启发式算法。测试在随机生成的实例上进行。实验表明,在上述条件下,该技术对MDVRPI是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Combining Heuristic Algorithm for the Multi-depot Vehicle Routing Problem with Inter-depot Routes Performance and Risk Analysis of Constructing an Electronic Alliance Import Platform for Hi-tech Equipment in China Recognition of Rainstorm Field in Flood Discharge of High Dam Based on Neural Network Application
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1