An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

In this article, we propose a solution procedure for the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). A relaxed version of this problem in which the path does not have to be elementary has been the backbone of a number of solution procedures based on column generation for several important problems, such as vehicle routing and crew pairing. In many cases relaxing the restriction of an elementary path resulted in optimal solutions in a reasonable computation time. However, for a number of other problems, the elementary path restriction has too much impact on the solution to be relaxed or might even be necessary. We propose an exact solution procedure for the ESPPRC, which extends the classical label correcting algorithm originally developed for the relaxed (nonelementary) path version of this problem. We present computational experiments of this algorithm for our specific problem and embedded in a column generation scheme for the classical Vehicle Routing Problem with Time Windows. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(3), 216–229 2004

[1]  Michel Gendreau,et al.  TRAVELING SALESMAN PROBLEMS WITH PROFITS: AN OVERVIEW , 2001 .

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

[3]  Natashia Boland,et al.  Improved preprocessing, labeling and scaling algorithms for the Weight‐Constrained Shortest Path Problem , 2003, Networks.

[4]  Jacques Desrosiers,et al.  2-Path Cuts for the Vehicle Routing Problem with Time Windows , 1997, Transp. Sci..

[5]  Gabriel Y. Handler,et al.  A dual algorithm for the constrained shortest path problem , 1980, Networks.

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

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

[8]  Sylvie Gélinas,et al.  A new branching strategy for time constrained routing problems with application to backhauling , 1992, Ann. Oper. Res..

[9]  Richard D. McBride,et al.  Flight crew scheduling , 1993 .

[10]  Marius Mihai Solomon,et al.  VEHICLE ROUTING AND SCHEDULING WITH TIME WINDOW CONSTRAINTS: MODELS AND ALGORITHMS (HEURISTICS) , 1984 .

[11]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

[12]  M H Farahi,et al.  AN ALGORITHM FOR THE SHORTEST PATH PROBLEM , 2005 .

[13]  Jesper Larsen,et al.  Lagrangean duality applied on vehicle routing with time windows , 2001 .

[14]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

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

[16]  John R. Current,et al.  Multiobjective transportation network design and routing problems: Taxonomy and annotation , 1993 .

[17]  Pierre Hansen,et al.  Solving the Bicriterion Shortest Path Problem From Both Ends , 1998 .

[18]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[19]  Michel Minoux,et al.  Graphes et algorithmes , 1995 .

[20]  M. Minoux,et al.  A new approach for crew pairing problems by column generation with an application to air transportation , 1988 .

[21]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[22]  Jacques Desrosiers,et al.  Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems , 2002 .

[23]  Jesper Larsen,et al.  Parallelization of the Vehicle Routing Problem with Time Windows , 1999 .

[24]  Egon Balas,et al.  The prize collecting traveling salesman problem: II. Polyhedral results , 1995, Networks.

[25]  Cyrille Gueguen.  Méthodes de résolution exacte pour les problèmes de tournées de véhicules , 1999 .

[26]  Mark Ziegelmann.  Constrained shortest paths and related problems , 2001 .

[27]  Arthur Warburton,et al.  Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..