Exact approaches for the pickup and delivery problem with loading cost

In this paper, we propose a branch-and-cut algorithm and a branch-and-price algorithm to solve the pickup and delivery problem with loading cost (PDPLC), which is a new problem derived from the classic pickup and delivery problem (PDP) by considering the loading cost in the objective function. Applications of the PDPLC arise in healthcare transportation where the objective function is customer-centric or service-based. In the branch-and-price algorithm, we devise an ad hoc label-setting algorithm to solve the pricing problem and employ the bounded bidirectional search strategy to accelerate the label-setting algorithm. The proposed algorithms were tested on a set of instances generated by a common data generator in the literature. The computational results showed that the branch-and-price algorithm outperformed the branch-and-cut algorithm by a large margin, and can solve instances with 40 requests to optimality in a reasonable time frame.

[1]  Jiazhen Huo,et al.  A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem , 2012 .

[2]  Nicolas Jozefowiez,et al.  Multi-objective vehicle routing problems , 2008, Eur. J. Oper. Res..

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

[4]  Nigel H. M. Wilson,et al.  A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .

[5]  Guy Desaulniers,et al.  Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows , 2008, Oper. Res..

[6]  Jacques Desrosiers,et al.  A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems , 1998 .

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

[8]  Zhixing Luo,et al.  Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints , 2014, Eur. J. Oper. Res..

[9]  Andrés L. Medaglia,et al.  An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints , 2016, Transp. Sci..

[10]  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..

[11]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

[12]  Yang-Byung Park,et al.  A heuristic for bi-objective vehicle routing with time window constraints , 1999 .

[13]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[14]  M. Vanhoucke,et al.  An integrated nurse staffing and scheduling analysis for longer-term nursing staff allocation problems , 2013 .

[15]  Hokey Min,et al.  A dial-a-ride problem for client transportation in a health-care organization , 2007, Comput. Oper. Res..

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

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

[18]  Gilbert Laporte,et al.  The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms , 2003, 4OR.

[19]  Jun Zhang,et al.  A scatter search algorithm for solving vehicle routing problem with loading cost , 2010, Expert Syst. Appl..

[20]  Y. Aneja,et al.  Using branch-and-price approach to solve the directed network design problem with relays , 2012 .

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

[22]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .

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

[24]  K. Ruland,et al.  The pickup and delivery problem: Faces and branch-and-cut algorithm , 1997 .

[25]  Gilbert Laporte,et al.  Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows , 2004 .

[26]  Egon Balas,et al.  The precedence-constrained asymmetric traveling salesman polytope , 1995, Math. Program..

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

[28]  Jacques Desrosiers,et al.  A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .

[29]  Stefan Irnich,et al.  Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem , 2015, Transp. Sci..

[30]  Lawrence Bodin,et al.  Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling , 1985, Transp. Sci..

[31]  Gilbert Laporte,et al.  Models and branch-and-cut algorithms for pickup and delivery problems with time windows , 2007 .

[32]  Andrew Lim,et al.  A Metaheuristic for the Pickup and Delivery Problem with Time Windows , 2003, Int. J. Artif. Intell. Tools.

[33]  Zhenzhen Zhang,et al.  A memetic algorithm for the patient transportation problem , 2015 .

[34]  Yiyo Kuo,et al.  A variable neighborhood search for the multi-depot vehicle routing problem with loading cost , 2012, Expert Syst. Appl..

[35]  Andrew Lim,et al.  Pickup and Delivery Service with Manpower Planning in Hong Kong Public Hospitals , 2017, Transp. Sci..

[36]  Mauro Dell'Amico,et al.  The bike sharing rebalancing problem: Mathematical formulations and benchmark instances , 2014 .

[37]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[38]  Gilbert Laporte,et al.  Dynamic pickup and delivery problems , 2010, Eur. J. Oper. Res..

[39]  Martin W. P. Savelsbergh,et al.  Drive: Dynamic Routing of Independent Vehicles , 1998, Oper. Res..

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

[41]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..

[42]  Jiafu Tang,et al.  A Max-Min Ant System for the split delivery weighted vehicle routing problem , 2013, Expert Syst. Appl..

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

[44]  Andrew Lim,et al.  The single vehicle routing problem with toll-by-weight scheme: A branch-and-bound approach , 2012, Eur. J. Oper. Res..

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