A branch-price-and-cut algorithm for the vehicle routing problem with release and due dates

Abstract In this paper, we investigate the vehicle routing problem with release and due dates (VRPRD), which is a new variant of vehicle routing problem (VRP). In the problem, the order required by a customer is available for delivery later than its release date. A penalty cost, called tardiness cost, will be imposed if a customer is served after its due date. The objective of the VRPRD is to minimize the total routing and weighted tardiness costs. To address the problem, we develop an exact branch-price-and-cut algorithm based on the set-partitioning formulation. An effective bidirectional labeling algorithm is proposed to deal with the pricing problem. Numerical studies have verified that the proposed algorithm can obtain the exact optimal solutions for more than 75 % of benchmark instances within approximately six minutes on average.

[1]  Benjamin C. Shelbourne.  The vehicle routing problem with release and due dates: formulations, heuristics and lower bounds , 2016 .

[2]  Chris N. Potts,et al.  The Vehicle Routing Problem with Release and Due Dates , 2017, INFORMS J. Comput..

[3]  Renato F. Werneck,et al.  Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2006, Math. Program..

[4]  Guy Desaulniers,et al.  A Branch-Price-and-Cut Algorithm for a Production-Routing Problem with Short-Life-Span Products , 2016, Transp. Sci..

[5]  Giovanni Righini,et al.  A column generation algorithm for the vehicle routing problem with soft time windows , 2011, 4OR.

[6]  Nicos Christofides,et al.  An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts , 2008, Math. Program..

[7]  Wei Zhang,et al.  Multi-depot multi-trip vehicle routing problem with time windows and release dates , 2020 .

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

[9]  Ruiyou Zhang,et al.  A branch-and-price algorithm for the multi-trip multi-repairman problem with time windows , 2018, Transportation Research Part E: Logistics and Transportation Review.

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

[11]  Eiichi Taniguchi,et al.  Branch-and-price algorithm for the location-routing problem with time windows , 2016 .

[12]  Guy Desaulniers,et al.  Exact Branch-Price-and-Cut Algorithms for Vehicle Routing , 2018, Transp. Sci..

[13]  Yang Yu,et al.  An exact algorithm for the multi-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport , 2015 .

[14]  Ismail Karaoglan,et al.  The coordinated production and transportation scheduling problem with a time-sensitive product: a branch-and-cut algorithm , 2017, Int. J. Prod. Res..

[15]  Arthur P. Hurter,et al.  THE NEWSPAPER PRODUCTION/DISTRIBUTION PROBLEM. , 1996 .

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

[17]  Maria Grazia Speranza,et al.  Dynamic traveling salesman problem with stochastic release dates , 2020, Eur. J. Oper. Res..

[18]  Leandro C. Coelho,et al.  Exact solution methods for the multi-period vehicle routing problem with due dates , 2019, Comput. Oper. Res..

[19]  Yung-Chia Chang,et al.  An ant colony optimization heuristic for an integrated production and distribution scheduling problem , 2014 .

[20]  Marcus Poggi de Aragão,et al.  Improved branch-cut-and-price for capacitated vehicle routing , 2016, Mathematical Programming Computation.

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

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

[23]  Maria Grazia Speranza,et al.  Complexity of routing problems with release dates , 2015, European Journal of Operational Research.

[24]  Sylvie Gélinas,et al.  A dynamic programming algorithm for the shortest path problem with time windows and linear node costs , 1994, Networks.

[25]  Maria Grazia Speranza,et al.  Vehicle routing problems over time: a survey , 2020, 4OR.

[26]  David Pisinger,et al.  Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows , 2008, Oper. Res..

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

[28]  Martin W. P. Savelsbergh,et al.  Complexity of routing problems with release dates and deadlines , 2018, Eur. J. Oper. Res..

[29]  Demetrio Laganà,et al.  An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows , 2020, Oper. Res..

[30]  Jongsung Lee,et al.  The nuclear medicine production and delivery problem , 2014, Eur. J. Oper. Res..

[31]  Maria Grazia Speranza,et al.  Multi-period Vehicle Routing Problem with Due dates , 2015, Comput. Oper. Res..