2009The Pickup and Delivery Problem with Transfers Formulation and a Branch-and-Cut Solution Method.pdfVIP

下载本文档

4
0
约 24页
2017-04-05 发布于江苏
举报
版权申诉

2009The Pickup and Delivery Problem with Transfers Formulation and a Branch-and-Cut Solution Method.pdf

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

2009The Pickup and Delivery Problem with Transfers Formulation and a Branch-and-Cut Solution Method

THE PICKUP AND DELIVERY PROBLEM WITH TRANSFERS: FORMULATION AND A BRANCH-AND-CUT SOLUTION METHOD CRISTIA?N E. CORTE?S, MARTI?N MATAMALA, AND CLAUDIO CONTARDO Abstract. In this paper, a strict formulation of a generalization of the classical pick up and de- livery problem is presented. Here, we add the flexibility of providing the option for passengers to transfer from one vehicle to another at specific locations. As part of the mathematical formula- tion, we include transfer nodes where vehicles may interact interchanging passengers. Additional variables to keep track of customers along their route are considered. The formulation has been proven to work correctly, and by means of a simple example instance, we conclude that there exist some configurations in which a scheme allowing transfers results in better quality optimal solutions. Finally, a solution method based on Benders decomposition is addressed. We compare the computational effort of this application with a straight branch and bound strategy; we also provide insights to develop more efficient set partitioning formulations and associated algorithms for solving real-size problems. 1. Introduction The pickup and delivery problem (PDP), as defined in the specialized literature, has been one of the most studied network logistic problems in the last decade [Desrosiers et al., 1995, Savelsbergh and Sol, 1995, Desrochers et al., 1988]. The PDP can be conceptually described as finding the optimal way of assigning a set of transportation requests to a fleet of vehicles (initially located at several depots), by minimizing a specific purpose objective function, subject to a variety of constraints. The objective function may include components such as operational costs, number of vehicles, customer’s level of service, and so on. A transportation request consists of picking up a certain number of passengers from a predeter- mined pickup location and dropping them off at a predetermined delivery location. In the version