Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines

The Pickup and Delivery Problem with Time Windows and Scheduled Lines (PDPTW-SL) consists of routing and scheduling a set of vehicles, by integrating them with scheduled public transportation lines, to serve a set of freight requests within their time windows. This paper presents an exact solution approach based on a branch-and-price algorithm. A path-based set partitioning formulation is used as the master problem, and a variant of the elementary shortest path problem with resource constraints is solved as the pricing problem. In addition, the proposed algorithm can also be used to solve the PDPTW with transfers (PDPTW-T) as a special case. Results of extensive computational experiments confirm the efficiency of the algorithm: it is able to solve small- and medium-size instances to optimality within reasonable execution time. More specifically, our algorithm solves the PDPTW-SL with up to 50 requests and the PDPTW-T with up to 40 requests on the considered instances.

[1]  Jean-François Cordeau,et al.  Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..

[2]  T. V. Woensel,et al.  A selected review on the negative externalities of the freight transportation: Modeling and pricing , 2015 .

[3]  Giovanni Righini,et al.  New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008 .

[4]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

[5]  Gilbert Laporte,et al.  A review of recent research on green road freight transportation , 2014, Eur. J. Oper. Res..

[6]  Stefan Irnich,et al.  Shortest Path Problems with Resource Constraints , 2005 .

[7]  David Pisinger,et al.  Scheduling Transportation of Live Animals to Avoid the Spread of Diseases , 2004, Transp. Sci..

[8]  Giovanni Righini,et al.  New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008, Networks.

[9]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[10]  Guy Desaulniers,et al.  Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows , 2006, Transp. Sci..

[11]  Gilbert Laporte,et al.  The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..

[12]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[13]  Zhi-Long Chen,et al.  Solving a Practical Pickup and Delivery Problem , 2003, Transp. Sci..

[14]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[15]  Henrik Andersson,et al.  The Integrated Dial-a-Ride Problem , 2009, Public Transp..

[16]  Tom Van Woensel,et al.  The pickup and delivery problem with time windows and scheduled lines , 2016, Transp. Sci..

[17]  Tom Van Woensel,et al.  A scenario-based planning for the pickup and delivery problem with time windows, scheduled lines and stochastic demands , 2016 .

[18]  Tom Van Woensel,et al.  An Exact Approach for a Variant of the Pollution-Routing Problem , 2017, Transp. Sci..

[19]  Fabien Lehuédé,et al.  The Dial-A-Ride Problem with Transfers , 2014, Comput. Oper. Res..

[20]  Maged M. Dessouky,et al.  Hybrid scheduling methods for paratransit operations , 2003, Comput. Ind. Eng..

[21]  Huseyin Topaloglu,et al.  Cargo Capacity Management with Allotments and Spot Market Demand , 2012, Oper. Res..

[22]  Anna Trentini,et al.  Toward a Shared Urban Transport System Ensuring Passengers & Goods Cohabitation , 2010 .

[23]  Jean-François Cordeau,et al.  Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints , 2012, OR Spectr..

[24]  Tom Van Woensel,et al.  An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines , 2016, Comput. Oper. Res..

[25]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[26]  Fabien Lehuédé,et al.  Optimization of a city logistics transportation system with mixed passengers and goods , 2017, EURO J. Transp. Logist..

[27]  Sophie N. Parragh.  Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem , 2011, Transportation research. Part C, Emerging technologies.

[28]  Stefan Pickl,et al.  Transshipment and time windows in vehicle routing , 2005, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05).

[29]  Roberto Roberti,et al.  New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem , 2011, Oper. Res..

[30]  J. Wesley Barnes,et al.  Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .

[31]  Chelsea C. White,et al.  A decision support system for the bimodal dial-a-ride problem , 1996, IEEE Trans. Syst. Man Cybern. Part A.

[32]  Ruslan Sadykov,et al.  In-Out Separation and Column Generation Stabilization by Dual Price Smoothing , 2013, SEA.

[33]  Roberto Baldacci,et al.  An Exact Algorithm for the Pickup and Delivery Problem with Time Windows , 2011, Oper. Res..

[34]  Maria Sameiro Carvalho,et al.  New mixed integer-programming model for the pickup-and-delivery problem with transshipment , 2014, Eur. J. Oper. Res..

[35]  M. Lindholm,et al.  Challenges in urban freight transport planning – a review in the Baltic Sea Region , 2012 .

[36]  Fabien Lehuédé,et al.  An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers , 2011, Transp. Sci..

[37]  Martin W. P. Savelsbergh,et al.  The General Pickup and Delivery Problem , 1995, Transp. Sci..

[38]  Fabien Lehuédé,et al.  A shared " passengers & goods " city logistics system , 2012, ICIS 2012.

[39]  Giovanni Righini,et al.  Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints , 2006, Discret. Optim..

[40]  Stefan Ropke,et al.  The Pickup and Delivery Problem with Cross-Docking Opportunity , 2011, ICCL.

[41]  Jen S. Shang,et al.  Multicriteria pickup and delivery problem with transfer opportunity , 1996 .

[42]  Martín Matamala,et al.  The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method , 2010, Eur. J. Oper. Res..

[43]  R. E. Marsten,et al.  The Boxstep Method for Large-Scale Optimization , 2011, Oper. Res..