Algorithms for the Weight Constrained Shortest Path Problem

Given a directed graph whose arcs have an associated cost, and associated weight, the weight constrained shortest path problem (WCSPP) consists of finding a least-cost path between two specified nodes, such that the total weight along the path is less than a specified value. We will consider the case of the WCSPP defined on a graph without cycles. Even in this case, the problem is NP-hard, unless all weights are equal or all costs are equal, however pseudopolynomial time algorithms are known. The WCSPP applies to a number of real-world problems. Traditionally, dynamic programming approaches were most commonly used, but in recent times other methods have been developed, including exact approaches based on Lagrangean relaxation, and fully polynomial approximation schemes. We will review the area and present a new exact algorithm, based on scaling and rounding of weights.

[1]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[2]  H. Joksch The shortest route problem with constraints , 1966 .

[3]  Jonathan Halpern,et al.  Shortest path with time constraints on movement and parking , 1974, Networks.

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

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

[7]  J. Desrosiers,et al.  Plus court chemin avec contraintes d'horaires , 1983 .

[8]  Y. P. Aneja,et al.  Shortest chain subject to side constraints , 1983, Networks.

[9]  Celso C. Ribeiro,et al.  A heuristic approach to hard constrained shortest path problems , 1985, Discret. Appl. Math..

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

[11]  M. Desrochers,et al.  A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .

[12]  M. Desrochers,et al.  A reoptimization algorithm for the shortest path problem with time windows , 1988 .

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

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

[15]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[16]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[17]  Brigitte Jaumard,et al.  A Two-Phase Resource Constrained Shortest Path Algorithm for Acyclic Graphs , 1996 .

[18]  George L. Nemhauser,et al.  Flight String Models for Aircraft Fleeting and Routing , 1998, Transp. Sci..

[19]  George L. Nemhauser,et al.  The asymmetric traveling salesman problem with replenishment arcs , 2000, Eur. J. Oper. Res..