Cost-based Filtering for Shorter Path Constraints

Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest Path Problems with additional constraints. A well studied problem in this class is the Resource Constrained Shortest Path Problem. Reduction techniques are vital ingredients of solvers for the CSPP, that is frequently NP-hard, depending on the nature of the additional constraints. Viewed as heuristics, these techniques have not been studied theoretically with respect to their efficiency, i.e., with respect to the relation of filtering power and running time. Using the concepts of Constraint Programming, we provide a theoretical study of cost-based filtering for shorter path constraints on acyclic, on undirected, and on directed graphs that do not contain negative cycles. We then show empirically how reasoning about path-substructures in combination with CP-based Lagrangian relaxation can help to improve significantly over previously developed problem-tailored filtering algorithms for the resource constrained shortest path problem and investigate the impact of required-edge detection, undirected versus directed filtering, and the choice of the algorithm optimizing the Lagrangian dual.

[1]  Kurt Mehlhorn,et al.  Resource Constrained Shortest Paths , 2000, ESA.

[2]  L FredmanMichael,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987 .

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

[4]  Meinolf Sellmann,et al.  Theoretical Foundations of CP-Based Lagrangian Relaxation , 2004, CP.

[5]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

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

[7]  Erlendur S. Thorsteinsson,et al.  Linear Relaxations and Reduced-Cost Based Propagation of Continuous Variable Subscripts , 2002, Ann. Oper. Res..

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

[9]  R. Borndoerfer,et al.  Scheduling duties by adaptive column generation , 2001 .

[10]  Stefan E. Karisch,et al.  Constraint Programming Based Column Generation for Crew Assignment , 2002, J. Heuristics.

[11]  Andrea Lodi,et al.  Cutting Planes in Constraint Programming: A Hybrid Approach , 2000, CP.

[12]  Krzysztof R. Apt,et al.  The Rough Guide to Constraint Propagation , 1999, CP.

[13]  Jean-Charles Régin,et al.  Arc Consistency for Global Cardinality Constraints with Costs , 1999, CP.

[14]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[15]  Cid C. de Souza,et al.  A Hybrid Approach for Solving Large Scale Crew Scheduling Problems , 2000, PADL.

[16]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[17]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[18]  Meinolf Sellmann,et al.  Cost-Based Filtering for Shorter Path Constraints , 2003, CP.

[19]  Guoliang Xue,et al.  Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees , 2000, Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086).

[20]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[21]  Francisco Barahona,et al.  The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..

[22]  Giorgio Gallo,et al.  A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems , 1999, INFORMS J. Comput..

[23]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

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

[25]  Andreas S. Schulz,et al.  Optimal Routing of Traffic Flows with Length Restrictions in Networks with Congestion , 1999 .

[26]  Diego Klabjan,et al.  A New Pricing Scheme for Airline Crew Scheduling , 2004, INFORMS J. Comput..

[27]  Andrea Lodi,et al.  Cost-Based Domain Filtering , 1999, CP.

[28]  Meinolf Sellmann.  An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint , 2002, CP.

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

[30]  Seth Pettie,et al.  Computing shortest paths with comparisons and additions , 2002, SODA '02.

[31]  Meinolf Sellmann,et al.  Coupling Variable Fixing Algorithms for the Automatic Recording Problem , 2001, ESA.

[32]  Ariel Orda,et al.  Routing with end to end QoS guarantees in broadband networks , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[33]  Uwe T. Zimmermann,et al.  Computer Aided Scheduling of Switching Engines , 2003 .

[34]  R. Bixby,et al.  On the Solution of Traveling Salesman Problems , 1998 .

[35]  Meinolf Sellmann,et al.  Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem , 2003, Ann. Oper. Res..

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

[37]  Meinolf Sellmann,et al.  Cost Based Filtering for the Constrained Knapsack Problem , 2002, Ann. Oper. Res..

[38]  Meinolf Sellmann,et al.  Shorter Path Constraints for the Resource Constrained Shortest Path Problem , 2005, CPAIOR.

[39]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

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

[41]  Stefan E. Karisch,et al.  A Framework for Constraint Programming Based Column Generation , 1999, CP.

[42]  Mikkel Thorup,et al.  Undirected single source shortest paths in linear time , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.