Advertisement

An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths

  • Chiun-Chieh Hsu
  • Da-Ren Chen
  • Hua-Yuan Ding
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5574)

Abstract

In this paper, we discuss the shortest path problem with forbidden paths (SPPFP), where the constraints come from a set of forbidden paths (arc sequences) that cannot be part of any feasible solution. SPPFP can be used to solve the problems with hard-to-modeled path constraints or to implement exact branching scheme.The method proposed by Villeneuve and Desaulniers first transfer the SPPFP problem to the k-shortest paths problem. We propose an algorithm which reduces execution time of solving the SPPFP problem via a nodes combination process. It improves the approach proposed by Villeneuve and Desaulniers. In addition, their algorithm for generating augmented paths could cause the inconsistency in particular situations. The proposed method also improves the weakness without increasing its time complexity.

Keywords

Shortest paths Forbidden paths Labeling algorithm Network flows 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho, A.V., Corasick, M.J.: Efficient string matching: An aid to bibliographic search. Journal of the ACM 18(6), 333–340 (1975)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Arunapuram, S., Mathur, K., Solow, D.: Vehicle routing and scheduling with full truck loads. Transportation Science 37, 170–182 (2003)CrossRefGoogle Scholar
  3. 3.
    Azevedo, J.A., Costa, M.E.O.S., Madeira, J.J.E.S., Martins, E.Q.V.: An algorithm for the ranking of shortest paths. European Journal of Operational Research 69, 97–106 (1993)CrossRefzbMATHGoogle Scholar
  4. 4.
    Chauny, F., Ratsirahonana, L., Savard, G.: A model and column generation algorithm for the aircraft loading problem, Les Cahiers du GERAD G-2000-68, Ecole des Hautes Etudes Commerciales, Montreal (2000)Google Scholar
  5. 5.
    Chen, Y.L., Yang, H.H.: Finding the first k shortest paths in a time-window network. Computers and Operations Research 31, 499–513 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Coutinho-Rodrigues, J.M., Climaco, J.C.N., Current, J.R.: An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. Computers and Operations Research 26, 789–798 (1999)CrossRefzbMATHGoogle Scholar
  7. 7.
    Desaulniers, G., Langevin, A., Riopel, D., Villeneuve, B.: Dispatching and conflict-free routing of automated guided vehicles: An exact approach, Les Cahiers du GERAD G-2002-31, Ecole des Hautes Etudes Commerciales, Montreal. International Journal of Flexible Manufacturing Systems (in press) (2002)Google Scholar
  8. 8.
    Eppstein, D.: Finding the k shortest paths. SIAM Journal on Computing 18(2), 652–673 (1999)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Gustafsson, T.: A heuristic approach to column generation for airline crew scheduling, Licentiate thesis, Chalmers University of Technology and Goteborg University, S-412 96 Goteborg, Sweden (1999)Google Scholar
  10. 10.
    Handler, G.Y., Zang, I.A.: A dual algorithm for the constrained shortest path problem. Networks 10, 293–310 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Hansen, P., Jaumard, B., de Aragao, M.P.: Un algorithme primal de programmation lineaire generalisee pourles programmes mixtes. Comptes Rendus de 1‘Academie des Sciences 313, 557–560 (1991) (in French)zbMATHGoogle Scholar
  12. 12.
    Hoffman, W., Pavley, R.: A method for the solution of the N‘th best path problem. Journal of the Association for Computing Machinery 6, 506–514 (1959)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Jiménez, V.M., Marzal, A.: Computing the k shortest paths: a new algorithm and an experimental comparison. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol. 1668, pp. 15–29. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  14. 14.
    Katoh, N., Ibaraki, T., Mine, H.: An efficient algorithm for k shortest simple paths. Networks 12, 411–427 (1982)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Lawler, E.L.: Aprocedure for computing the k best solutions to discrete optimization problems and its application to the shortest path. Management Science 18(7), 401–405 (1972)CrossRefzbMATHGoogle Scholar
  16. 16.
    Martins, E.Q.V.: An algorithm for ranking paths that contain cycles. European Journal of Operational Research 18, 123–130 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Villeneuve, D., Desaulniers, G.: The shortest path problem with forbidden paths. European Journal of Operational Research 165, 97–107 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Yang, H.H., Chen, Y.L.: Finding k shortest looping paths in a traffic-light network. Computers and Operations Research 32, 571–581 (2005)CrossRefzbMATHGoogle Scholar
  19. 19.
    Yang, H.H., Chen, Y.L.: Finding K shortest looping paths with waiting time in a time-windows network. Applied Mathematical Modelling 30, 458–465 (2006)CrossRefzbMATHGoogle Scholar
  20. 20.
    Yen, Y.J.: Finding the k shortest loopless paths in a network. Management Science 17(11), 712–716 (1971)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Zijpp, N.J., Catalano, S.F.: Path enumeration by finding the constrained k-shortest paths. Transport Research B 39, 545–563 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Chiun-Chieh Hsu
    • 1
  • Da-Ren Chen
    • 2
  • Hua-Yuan Ding
    • 1
  1. 1.Department of Information ManagementNational Taiwan University of Science and TechnologyTaipei, 106Taiwan, R.O.C.
  2. 2.Department of Information ManagementHwa Hsia Institute of TechnologyTaipei, 235Taiwan, R.O.C.

Personalised recommendations

Cite paper

Buy options