Time-dependent Hyperstar algorithm for robust vehicle navigation

Transportation Research Part A: Policy and Practice

Volumn 46, Issue 5, 2012, Pages 790-800

  Bell, Michael G H ^a   Trozzi, Valentina ^a   Hosseinloo, Solmaz Haji ^a   Gentile, Guido ^b   Fonzone, Achille ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Robust route guidance; Uncertain networks; Vehicle navigation

Indexed keywords

PROBABILITY; TIME OF ARRIVAL; TRAFFIC CONTROL; TRAVEL TIME; VEHICLES;

INTERMEDIATE NODE; LINK TRAVEL TIME; NODE POTENTIALS; ROBUST ROUTE GUIDANCE; SOLUTION ALGORITHMS; TIME DEPENDENT; UNCERTAIN NETWORKS; VEHICLE NAVIGATION;

NAVIGATION;

ALGORITHM; NAVIGATION; PROBABILITY; TIME DEPENDENT BEHAVIOR; TRANSPORT VEHICLE; TRAVEL TIME; UNCERTAINTY ANALYSIS;

EID: 84859159548     PISSN: 09658564     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tra.2012.02.002     Document Type: Article

References (20)

1. Bell M.G.H. Hyperstar: a multi-path Astar algorithm for risk averse vehicle navigation. Transportation Research Part B 2009, 43:97-107.
2. * algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks. IEEE Transactions on Intelligent Transportation Systems 2002, 3:60-74.
3. Chen Y.Y., Bell M.G.H., Bogenberger K. Reliable pretrip multipath planning and dynamic adaptation for a centralised road navigation system. IEEE Transactions on Intelligent Transportation Systems 2007, 8(1):14-20.
4. Dijkstra E.W. A note on two problems in connexion with graphs. Numerische Mathematik 1959, 1(1):269-271.
5. Gallo G., Longo G., Pallottino S., Nguyen S. Directed hypergraphs and applications. Discrete Applied Mathematics 1993, 42:177-201.
6. Hall R.W. The fastest path through a network with random time-dependent travel times. Transportation Science 1986, 20(3):182-188.
7. Hart P.E., Nilsson N.J., Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems, Science and Cybernetics 1968, 4(2):100-107.
8. Kaparias, I., 2008. Reliable Dynamic In-vehicle Navigation. PhD Thesis, Imperial College London.
9. Kaufman D., Smith R. Fastest paths in time-dependent networks for Intelligent Vehicle Highway Systems applications. IVHS Journal 1993, 1:1-11.
10. Miller-Hooks E.D. Adaptive least-expected time paths in stochastic, time-varying transportation and data networks. Networks 2001, 37(1):35-52.
11. Miller-Hooks E.D., Mahmassani H.S. Least expected time paths in stochastic, time-varying transportation networks. Transportation Science 1998, 34(2):198-215.
12. Nguyen S., Pallotino S. Equilibrium traffic assignment for large scale transit networks. European Journal of Operational Research 1988, 37(2):176-186.
13. Nielsen L.R., Andersen K.A., Pretolani D. Finding the K shortest hyperpaths. Computers and Operations Research 2005, 32:1477-1497.
14. Park, K., 2009. Learning User Preferences for Intelligent Adaptive In-vehicle Navigation. PhD Thesis, Imperial College London.
15. Park K., Bell M.G.H., Kaparias I., Bogenberger K. Learning user preferences of route choice behaviour for adaptive route guidance. IET Intelligent Transport Systems 2007, 1(2):159-166.
16. Pretolani D. A directed hypergraph model for random time dependent shortest paths. European Journal of Operational Research 2000, 123:315-324.
17. Schmoecker J.D., Bell M.G.H., Kurauchi F., Shimamoto H. A game theoretic approach to the determination of hyperpaths in transportation networks. Transportation and Traffic Theory 2009: Golden Jubilee 2009, 1-18. Springer, Berlin. W.H.K. Lam, S.C. Wong, H.K. Lo (Eds.).
18. Spiess H., Florian M. Optimal strategies: a new assignment model for transit networks. Transportation Research Part B 1989, 23(2):83-102.
19. Sung K., Bell M.G.H., Seong M., Park S. Shortest paths in a network with time dependent flow speeds. European Journal of Operational Research 2000, 121:32-39.
20. Wagner, D., Willhalm, T., 2006. Speed-Up Techniques for Shortest-Path Computations. ARRIVAL-TR-0024. http://www.arrival.cti.gr/.