# Cost-based Filtering for Shorter Path Constraints

- 88 Downloads
- 5 Citations

## Abstract

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.

## Keywords

Constrained shortest paths Problem reduction Global constraints Optimization constraints Relaxed consistency## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Ahuja, R.K., Magnati, T.L., & Orlin, J.B. (1993).
*Network flows*. Prentice-Hall.Google Scholar - 2.Aneja, Y., Aggarwal, V., & Nair, K. (1983). Shortest chain subject to side conditions.
*Netw*.*13*, 295–302.CrossRefMathSciNetGoogle Scholar - 3.Apt, K.R. (1999). The rough guide to constraint propagation. In
*Principles and Practice of Constraint Programming (CP) LNCS 1713*, pp 1–23. Springer.Google Scholar - 4.Barahona, F., & Anbil, R. (2000). The volume algorithm: Producing primal solutions with a subgradient algorithm.
*Math. Program.**87*, 385–399.zbMATHCrossRefMathSciNetGoogle Scholar - 5.Beasley, J., & Christofides, N. (1989). An algorithm for the resource constrained shortest path problem.
*Netw.**19*, 379–394.zbMATHMathSciNetGoogle Scholar - 6.Borndoerfer, R., & Loebel, A. (2001).
*Scheduling Duties by Adaptive Column Generation*. Technical Report, Konrad-Zuse-Zentrum fuer Informationstechink Berlin ZIB-01-02.Google Scholar - 7.Cormen, T.H., Leiserson, C.E., & Rivest, R.L. (1993).
*Introduction to Algorithms.*MIT.Google Scholar - 8.Crowder, H. (1976). Computational improvements for subgradient optimization.
*Symp. Math.**19*, 357–372.MathSciNetGoogle Scholar - 9.Desrosiers, J., Dumas, Y., Solomon, M., & Soumis, F. (1995). Time constrained routing and scheduling. In
*Handbook in Operations Research and Management Science 8: Network Routing*,*8*, 35–139. Amsterdam, The Netherlands: North Holland.Google Scholar - 10.Dumitrescu, I., & Boland, N. (2000). The weight-constrained shortest path problem: preprocessing, scaling and dynamic programming algorithms with numerical comparisons. In
*International Symposium on Mathematical Programming (ISMP)*. Atlanta, Georgia: Georgia Institute of Technology.Google Scholar - 11.Fahle, T., Junker, U., Karisch, S.E., Kohl, N., Sellmann, M., & Vaaben, B. (2002). Constraint programming based column generation for crew assignment.
*J. Heuristics*.*8*(1), 59–81.zbMATHCrossRefGoogle Scholar - 12.Fahle, T., & Sellmann, M. (2002). Cost-based filtering for the constrained knapsack problem.
*Ann. Oper. Res.**115*, 73–93.zbMATHCrossRefMathSciNetGoogle Scholar - 13.Focacci, F., Lodi, A., & Milano, M. (1999). Cost-based domain filtering. In
*Principles and Practice of Constraint Programming (CP) LNCS**1713*, pp 189–203. Springer.Google Scholar - 14.Focacci, F., Lodi, A., & Milano, M. (2000).
*Cutting Planes in Constraint Programming: An Hybrid Approach*. Technical Report: tr-001-2000, Paderborn Center for Parallel Computing, University of Paderborn, Germany. (CP-AI-OR’00, pp 45–51.)Google Scholar - 15.Fortune, S., Hopcroft, J., & Wyllie, J. (1980). The directed subgraph homeomorphism problem.
*Theor. Comp. Sci.**10*(2), 111–121.zbMATHCrossRefMathSciNetGoogle Scholar - 16.Frangioni, A. (1996).
*A Bundle Type Dual-ascent Approach to Linear Multi-commodity Min Cost Flow Problems*. Technical Report, Dipartimento di Informatica, Universita di Pisa. (tr-96-01)Google Scholar - 17.Frangioni, A. (1997).
*Dual Ascent Methods and Multicommodity Flow Problems.*Doctoral Thesis TD-97-05, Dipartimento di Informatica, Universita di Pisa.Google Scholar - 18.Fredmann, M.L., & Tarjan, R.E. (1987). Fibonacci heaps and their uses in improved network optimization algorithms.
*J. ACM**34*, 596–615.CrossRefGoogle Scholar - 19.Garey, M.R., & Johnson, D.S. (1979).
*Computers and Intractability, A Guide to the Theory of NP-Completeness*. Freeman.Google Scholar - 20.Gellermann, T., Sellmann, M., & Wright, R.W. (2005). Shorter path constraints for the resource constrained shortest path problem. In
*Second International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR) LNCS 3524*, pp 201–216. Springer.Google Scholar - 21.Handler, G., Zang, I. (1980). A dual algorithm for the restricted shortest path problem.
*Netw.**10*, 293–310.CrossRefMathSciNetGoogle Scholar - 22.Jahn, O., Moehring, R., & Schulz, A. (1999).
*Optimal Routing of Traffic Flows with Length Restrictions in Networks with Congestion*. Technical Report, TU Berlin. (pp 658–1999)Google Scholar - 23.Joksch, H. (1966). The shortest route problem with constraints.
*J. Math. Anal. Appl.**14*, 191–197.zbMATHCrossRefMathSciNetGoogle Scholar - 24.Junker, U., Karisch, S.E., Kohl, N., Vaaben, B., Fahle, T., & Sellmann, M. (1999). A framework for constraint programming based column generation. In
*Principles and Practice of Constraint Programming (CP), LNCS 1713*, pp 261–274. Springer.Google Scholar - 25.Kelley, J.E. (1960). The cutting plane method for solving convex programs.
*J. SIAM.**8*, 703–712.MathSciNetGoogle Scholar - 26.Kumar, V. (1992). Algorithms for constraints satisfaction problems: a survey.
*AI Mag.**13*, 32–44.(AAAI)Google Scholar - 27.Luebbecke, M., & Zimmermann, U. (2000). Computer aided scheduling of switching engines.
*CASPT*. Springer.Google Scholar - 28.Mehlhorn, K., & Ziegelmann, M. (2000). Resource constrained shortest paths. In
*Proc. 8th European Symposium on Algorithms (ESA) LNCS 1879*, pp 326–337. Springer.Google Scholar - 29.Orda, A. (1998). Routing with end to end QoS guarantees in broadband networks. In
*Conference on Computer Communications (Infocom)*, pp 27–34. IEEE.Google Scholar - 30.Ottosson, G., & Thorsteinsson, E.S. (2000).
*Linear Relaxation and Reduced-cost Based Propagation of Continuous Variable Subscripts*. Technical Report, Paderborn Center for Parallel Computing. (tr-001-2000,*CP-AI-OR’00*, pp 129–138)Google Scholar - 31.Pettie, S., & Ramachandran, V. (2002). Computing undirected shortest paths using comparisons and additions. In
*ACM-SIAM Symposium on Discrete Algorithms*, pp 267–276. Society for Industrial and Applied Mathematics. (January).Google Scholar - 32.Régin, J.C. (1999). Arc consistency for global cardinality constraints with costs. In
*Principles and Practice of Constraint Programming (CP) LNCS 1713*, pp 390–404. Springer.Google Scholar - 33.Sellmann, M. (2002a). An arc-consistency algorithm for the weighted all different constraint. In
*Principles and Practice of Constraint Programming (CP) LNCS 2470*, pp 744–749. Springer.Google Scholar - 34.Sellmann, M. (2003). Cost-based filtering for shorter path constraints. In
*Principles and Practice of Constraint Programming (CP) LNCS, 2833*, pp 679–693. Springer.Google Scholar - 35.Sellmann, M. (2004). Theoretical foundations of CP-based Lagrangian relaxation. In
*Principles and Practice of Constraint Programming (CP) LNCS 3258*, pp 634–647. Springer.Google Scholar - 36.Sellmann, M., & Fahle, T. (2001). Coupling variable fixing algorithms for the automatic recording problem. In
*Annual European Symposium on Algorithms (ESA) LNCS 2161*, pp 134–145. Springer.Google Scholar - 37.Sellmann, M., & Fahle, T. (2003). Constraint programming based lagrangian relaxation for the automatic recording problem.
*Ann. Oper. Res.**118*, 17–33.zbMATHCrossRefMathSciNetGoogle Scholar - 38.Thorup, M. (1997). Undirected single source shortest paths in linear time. In
*Annual Symposium on Foundations of Computer Science (FOCS)*, pp 12–21. IEEE Computer Society.Google Scholar - 39.Xue, G. (2000). Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees. In
*International Performance, Computing, and Communications Conference (IPCCC)*, pp 271–277. IEEE.Google Scholar - 40.Yunes, T.H., Moura, A.V., & Souza, C.C. (2000). A hybrid approach for solving large crew scheduling problems. In
*International Workshop on Practical Aspects of Declarative Languages (PADL) LNCS 1753*, pp 293–307. Springer.Google Scholar