Hyperstar: A multi-path Astar algorithm for risk averse vehicle navigation

Transportation Research Part B: Methodological

Volumn 43, Issue 1, 2009, Pages 97-107

  Bell, Michael G H ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Robust route guidance; Uncertain networks; Vehicle navigation

Indexed keywords

NAVIGATION SYSTEMS; RISK ANALYSIS; TRAFFIC CONGESTION; TRAFFIC CONTROL; TRAVEL TIME; VEHICLES;

A-STAR ALGORITHM; LINK TRAVEL TIME; ROBUST ROUTE GUIDANCE; TRANSIT NETWORKS; TRAVEL TIME RELIABILITY; UNCERTAIN NETWORKS; VEHICLE NAVIGATION; VEHICLE NAVIGATION SYSTEM;

AIR NAVIGATION;

ALGORITHM; NAVIGATION; NUMERICAL MODEL; OPTIMIZATION; PATH ANALYSIS; PLANNING METHOD; ROAD TRANSPORT; TRAFFIC CONGESTION; TRANSPORTATION PLANNING; TRAVEL TIME; UNCERTAINTY ANALYSIS;

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

References (26)

1. Akgun V., Erkut E., and Batta R. On finding dissimilar paths. European Journal of Operational Research 121 2 (2000) 232-246
2. Azevedo J.A., Santos Costa M.E.O., Silvestre Madera J.J.E.R., and Vieira Martins E.Q. An algorithm for the ranking of shortest paths. European Journal of Operational Research 69 1 (1993) 97-106
3. Barra, T., (1993). Multidimensional path search and assignment. In: Proceedings of the 21st PTRC Summer Annual Conference, pp. 167-172.
4. Bauer, R., Delling, D., Wagner, D., (2007). Experimental study on speed-up techniques for timetable information systems. ARRIVAL-TR-91 (/).
5. Bekhor, S., Ben-Akiva, M.E., Ramming, S., (2001). Route choice: choice set generation and probabilistic choice models. In: Proceedings of the 4th TRISTAN Conference, Azores, Portugal.
6. Ben-Akiva M., Bergman M.J., Daly A.J., and Ramaswamy R. Modeling inter-urban route choice behaviour. Proceedings of the Ninth International Symposium on Transportation and Traffic Theory (1984), VNU Science Press, Utrecht pp. 299-330
7. Chen Y.Y., Bell M.G.H., and Bogenberger K. Reliable pretrip multipath planning and dynamic adaptation for a centralised road navigation system. IEEE Transactions on Intelligent Transportation Systems 8 1 (2007) 14-20
8. Dial R.B. Bicriterion traffic equilibrium: T2 mode, algorithm, software overview. Transportation Research Record 1725 (2000) 54-62
9. Dijkstra E.W. A note on two problems in connexion with graphs. Numerische Mathematik 1 1 (1959) 269-271
10. Dinic E.A. Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Mathematics Doklady 11 (1970) 248-264
11. Eppstein D. Finding the k-shortest paths. SIAM Journal of Computing 28 2 (1998) 652-673
12. Hart P.E., Nilsson N.J., and Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC4 2 (1968) 100-107
13. Jimenez V.M., and Marzal A. Computing the k-shortest paths: a new algorithm and an experimental comparison. Lecture Notes in Computer Science Series vol. 1688 (1999), Springer-Verlag pp. 15-29
14. Martins E.Q.V., Pascoal M.M.B., and Santos J.L.E. Deviation algorithms for ranking shortest paths. International Journal of Foundations of Computer Science 10 3 (1999) 247-261
15. Nguyen S., and Pallotino S. Equilibrium traffic assignment for large scale transit networks. European Journal of Operational Research 37 2 (1988) 176-186
16. Park D., and Rilett L.R. Identifying multiple and reasonable paths in transportation networks: a heuristic approach. Transportation Research Record 1607 (1997) 31-37
17. Park K., Bell M.G.H., Kaparias I., and Bogenberger K. Learning user preferences of route choice behaviour for adaptive route guidance. IET Intelligent Transport Systems 1 2 (2007) 159-166
18. Prato C.G., and Bekhor S. Applying branch-and-bound technique to route choice set generation. Transportation Research Record 1985 (2006) 19-28
19. Pu, J., Manning, E.G., Shoja, G.C., Srinivasan, A. (2001). A new algorithm to compute alternate paths in reliable OSPF (ROSPF). In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2001), 1, pp. 299-304.
20. Rouphail, N.M., (1995). A decision support system for dynamic pre-trip route planning. In: Proceedings of the 4th ASCE International Conference on Application of Advanced Technologies in Transportation (AATT), New York, pp. 325-329.
21. Scott, K., Pabon-Jimenez, G., Bernstein, D., (1997). Finding alternatives to the best path. In: Proceedings of the 76th Annual Meeting of the Transportation Research Board, Washington, DC.
22. Sheffi Y., and Powell W.B. An algorithm for the equilibrium assignment problem with random link times. Networks 12 2 (1982) 191-207
23. Spiess H., and Florian M. Optimal strategies: a new assignment model for transit networks. Transportation Research Part B 23 2 (1989) 83-102
24. Torrieri D. Algorithms for finding an optimal set of short disjoint paths in a communication network. IEEE Transactions on Communications 40 11 (1992) 1698-1702
25. Van der Zijpp N.J., and Fiorenzo-Catalano S. Path enumeration by finding the constrained k-shortest paths. Transportation Research Part B 39 6 (2005) 545-563
26. Wagner, D., Willhalm, T., (2006). Speed-up techniques for shortest path computations. ARRIVAL-TR-0024 ().