A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem.pdfVIP

A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem.pdf

  1. 1、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem

ARTICLE IN PRESS0925-5273/$ - se doi:10.1016/j.ijp Correspondi E-mail addreInt. J. Production Economics 105 (2007) 228–242 /locate/ijpeA two-stage algorithm with valid inequalities for the split delivery vehicle routing problem Mingzhou Jin, Kai Liu, Royce O. Bowden Department of Industrial and Systems Engineering, Mississippi State University, P.O. Box 9542, Mississippi State, MS, 39762, USA Received 1 November 2004; accepted 1 April 2006 Available online 3 July 2006Abstract This paper proposes a two-stage (TS) algorithm with valid inequalities (TSVI) to optimally solve the split delivery vehicle routing problem (SDVRP). The first stage in the TSVI creates clusters that cover all demand and establishes a lower bound. The second stage calculates the minimal distance traveled for each cluster by solving the corresponding traveling salesman problem (TSP). The sum of the minimal distance traveled over all clusters yields an upper bound. The minimal distance of each TSP is added as cuts (constraints) into the first stage for the vehicles visiting all the points covered by the TSP problem. This iterative procedure stops with an optimal solution when no new clusters are created in the first stage. The TS scheme provides opportunities to develop strong valid inequalities for the first stage to improve the overall computational speed. Seven valid inequalities are developed. One of the valid inequalities is created to address the symmetric nature of a solution caused by the index combinations of vehicles. Another strong valid inequality is created to provide a lower bound on the distance traveled for each subset of demand points. Conditions under which a delivery to a demand point is not split in an optimal solution are studied in order to create additional valid inequalities. The numerical experiments show that the TSVI significantly outperforms other exact solution approaches provided in the literature for the SDVRP. r 2006 Elsevier B.V. All rights reserved. Keywords: Sp

文档评论(0)

l215322 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档