Journal article
Branch-and-Cut-and-Price for the Pickup and Delivery Problem with Time Windows
In the pickup and delivery problem with time windows (PDPTW), vehicle routes must be designed to satisfy a set of transportation requests, each involving a pickup and a delivery location, under capacity, time window, and precedence constraints. This paper introduces a new branch-and-cut-and-price algorithm in which lower bounds are computed by solving through column generation the linear programming relaxation of a set partitioning formulation.
Two pricing subproblems are considered in the column generation algorithm: an elementary and a non-elementary shortest path problem. Valid inequalities are added dynamically to strengthen the relaxations. Some of the previously proposed inequalities for the PDPTW are also shown to be implied by the set partitioning formulation.
Computational experiments indicate that the proposed algorithm outperforms a recent branch-and-cut algorithm.
Language: | English |
---|---|
Publisher: | Transportation Science & Logistic Society of the Institute for Operations Research and Management Sciences |
Year: | 2009 |
Pages: | 267-286 |
ISSN: | 15265447 and 00411655 |
Types: | Journal article |
DOI: | 10.1287/trsc.1090.0272 |
ORCIDs: | Røpke, Stefan |