Path enumeration by finding the constrained K-shortest paths

Transportation Research Part B: Methodological

Volumn 39, Issue 6, 2005, Pages 545-563

  van der Zijpp, N J ^a,b   Catalano, S Fiorenzo ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b Modelit   (Netherlands)

Author keywords

Constrained K shortest paths; K shortest paths; Path enumeration

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; ROADS AND STREETS; SENSITIVITY ANALYSIS;

CONSTRAINED K-SHORTEST PATHS (CKSP); PATH ENUMERATION; RESTRICTIVE CONSTRAINTS; SMALL NETWORKS;

PROBLEM SOLVING;

PATH ANALYSIS;

EID: 11244354976     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2004.07.004     Document Type: Article

References (24)

1. A. Akgun E. Erkut R. Batta On finding dissimilar paths European Journal of Operation Research 121 2000 232-246
2. Y.P. Aneja V. Aggarwal K.P.K. Nair Shortest chain subject to side constraints Networks 13 1983 295-302
3. Bekhor, S., Ben-Akiva, M., Ramming, S., 2001. Route choice: Choice set generation and probabilistic choice models. In: Proceedings of TRISTAN IV Conference, pp. 459-464
4. R. Bellman R. Kabala On kth best policies Journal of SIAM 8 1960 582-585
5. M. Ben-Akiva M.J. Bergman A.J. Daly R. Ramaswamy Modeling inter-urban route choice behaviour In: J. Volmuller R. Hamerslag (Eds.) Proceedings Ninth International Symposium on Transportation and Traffic Theory 1984 VNU Science Press Utrecht 299-330
6. Brander, A.W., Sinclair, M.C., 1995. A comparative study of k-shortest path algorithms. In: Proc. 11th UK Performance Engineering Workshop for Computer and Telecommunications Systems
7. De La Barra, T., Perez, B., Anez, J., 1993. Multidimensional path search and assignment. In: Proceedings of the 21st PTRC Summer Annual Meeting, Manchester, England
8. Dial, R.B., 2000. Bicriterion traffic equilibrium: T2 mode, algorithm, software overview. Transportation Research Record 1725, Transportation Research Board, Washington DC, pp. 54-62
9. E.W. Dijkstra A note on two problems in connection with graphs Numerical Mathematics 1 1959 269-271
10. Eppstein, D., 1994. Finding the K shortest paths. In: Proc. 35th IEEE Symp. Foundations of Computer Science (FOCS'94), pp. 154-165
11. D. Eppstein Finding the K shortest paths SIAM Journal Computing 28 2 1998 652-673
12. M.S. Fiorenzo Catalano N.J. Van der Zijpp A forecasting model for inland navigation based on route enumeration In: European Transport Conference, 10-12 September 2001 2001 PTRC Education and Research Services Ltd. London 1-11
13. B.L. Fox Data structures and computer science techniques in operations research Operations Research 26 1978 686-717
14. E. Hadjiconstantinou N. Christofides An efficient implementation of an algorithm for finding k shortest simple paths Networks 34 1999 88-101
15. G. Handler I. Zang A dual algorithm for the constrained shortest path problem Networks 10 1980 293-310
16. W. Hoffman R. Pavley A method for the solution of the nth best path problem Journal of the Association for Computing Machinery (ACM) 6 1959 506-514
17. N. Katoh T. Ibaraki H. Mine An efficient algorithm for k shortest simple paths Networks 12 1982 411-427
18. E.L. Lawler Combinatorial Optimization: Networks and Matroids 1976 Holt, Rinehart & Winston New York
19. D.R. Shier Iterative methods for determining the K shortest paths in a network Networks 6 1976 205-229
20. D.R. Shier On algorithms for finding the K-shortest paths in a network Networks 9 1979 195-214
21. Schnabel, W., Lohse, D., 1997. Grundlagen der Strasssen-Verkehrstechnik under Verkehrsplanung, Band 2, neue bearb. Aufl. - 1997. Verlag für Bauwesen Gmbh, Berlin
22. Scott, K., Pabón-Jiménez, G., Bernstein, D., 1997. Finding alternatives to the best path. Presented at the 76th Annual Meeting of the Transportation Research Board, Washington, DC, 12 p
23. Van der Zijpp, N.J., Fiorenzo Catalano, M.S., 2002. An algorithm for finding the K-acyclic shortest paths with logical constraints and its application to the route enumeration problem. Preprints of the 81th Annual Meeting of the Transportation Research Board, Washington, DC, Paper 02-3981 on Preprint CDROM, pp. 1-13
24. J.Y. Yen Finding the K shortest loopless paths in a network Management Science 17 1971 712-716