A rollout algorithm for the resource constrained elementary shortest path problem

ABSTRACT This paper presents a metaheuristic approach for the resource constrained elementary shortest path problem (). arises as pricing problem, when the vehicle routing problem is solved by branch-and-price algorithms. The availability of efficient metaheuristic and optimal solution approaches has contributed to the success of solution procedures based on column-generation. We focus on rollout strategies integrated with local search strategies. The scientific literature considers metaheuristics based on a tabu search procedure in order to price out columns. A comparative analysis between the proposed rollout approaches and the tabu search is conduced and the effectiveness of our proposed algorithms is tested. A comparison with exact solution approaches is also carried out in order to assess the behaviour of the implemented solution strategies in terms of both efficiency and solution quality.

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

[2]  Luigi Di Puglia Pugliese,et al.  A Reference Point Approach for the Resource Constrained Shortest Path Problems , 2013, Transp. Sci..

[3]  Roberto Musmanno,et al.  New Rollout Algorithms for Combinatorial Optimization Problems , 2002, Optim. Methods Softw..

[4]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

[5]  Niklas Kohl,et al.  Exact methods for time constrained routing and related scheduling problems , 1995 .

[6]  Manuel Laguna,et al.  Tabu Search , 1997 .

[7]  Matteo Salani,et al.  Branch and price for the vehicle routing problem with discrete split deliveries and time windows , 2011, Eur. J. Oper. Res..

[8]  Luigi Di Puglia Pugliese,et al.  A survey of resource constrained shortest path problems: Exact solution approaches , 2013, Networks.

[9]  Giovanni Righini,et al.  A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection , 2006, Transp. Sci..

[10]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Suboptimal Control: A Survey from ADP to MPC , 2005, Eur. J. Control.

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

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

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

[14]  Simon Spoorendonk,et al.  A Branch-and-Cut Algorithm for the Elementary Shortest Path Problem with a Capacity Constraint , 2008 .

[15]  Guy Desaulniers,et al.  New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows , 2016, INFORMS J. Comput..

[16]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[17]  Nicos Christofides,et al.  An algorithm for the resource constrained shortest path problem , 1989, Networks.

[18]  Stefan Irnich,et al.  The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3 , 2006, INFORMS J. Comput..

[19]  Stefan Irnich,et al.  In-Depth Analysis of Pricing Problem Relaxations for the Capacitated Arc-Routing Problem , 2015, Transp. Sci..

[20]  Luigi Di Puglia Pugliese,et al.  A computational study of solution approaches for the resource constrained elementary shortest path problem , 2012, Annals of Operations Research.

[21]  Guy Desaulniers,et al.  Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows , 2009, Transp. Sci..

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

[23]  Moshe Dror,et al.  Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW , 1994, Oper. Res..

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

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

[26]  Francesca Guerriero,et al.  A cooperative parallel rollout algorithm for the sequential ordering problem , 2003, Parallel Comput..

[27]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[28]  F. Guerriero.  Hybrid Rollout Approaches for the Job Shop Scheduling Problem , 2008 .

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

[30]  John N. Tsitsiklis,et al.  Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.

[31]  Natashia Boland,et al.  Accelerated label setting algorithms for the elementary resource constrained shortest path problem , 2006, Oper. Res. Lett..

[32]  Stefan Irnich.  Resource extension functions: properties, inversion, and generalization to segments , 2008, OR Spectr..

[33]  Michael Joswig,et al.  Computing convex hulls and counting integer points with polymake , 2014, 1408.4653.

[34]  John N. Tsitsiklis,et al.  Rollout Algorithms for Combinatorial Optimization , 1997, J. Heuristics.

[35]  Francesca Guerriero,et al.  Parallelization Strategies for Rollout Algorithms , 2005, Comput. Optim. Appl..

[36]  Guy Desaulniers,et al.  Reaching the elementary lower bound in the vehicle routing problem with time windows , 2015, Networks.