Algorithms to find shortest and alternative paths in free flow and congested traffic regimes

Transportation Research Part C: Emerging Technologies

Volumn 73, Issue , 2016, Pages 24-28

  Faro, Alberto ^a   Giordano, Daniela ^a  

^a UNIVERSITY OF CATANIA   (Italy)

Author keywords

All Pair Shortest Paths (APSP); Single Source Shortest Paths (SSSP); Traffic emergency assistance; Ubiquitous information systems

Indexed keywords

MOTOR TRANSPORTATION; ROADS AND STREETS; TRAFFIC CONGESTION;

ALL-PAIR SHORTEST PATH; LOCATION-BASED SYSTEMS; METROPOLITAN AREA; PERFORMANCE ANALYSIS; SINGLE SOURCE SHORTEST PATHS; TRAFFIC CONDITIONS; TRANSPORT NETWORKS; UBIQUITOUS INFORMATION SYSTEMS;

GRAPH THEORY;

ALGORITHM; INFORMATION SYSTEM; ROAD TRAFFIC; ROAD TRANSPORT; TRAFFIC CONGESTION; URBAN TRANSPORT;

EID: 84992521827     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2016.09.009     Document Type: Article

References (55)

1. Ansari, A., et al. An optimized hybrid approach for path finding. Int. J. Found. Comput. Sci. Technol. 5:2 (2015), 47–58.
2. Anwar, T., Liu, C., Vu, Hl., Leckie, C., 2014. Spatial partitioning of large urban road networks. In: Proc. of 17th Int. Conf. on Extending Database Technology (EDBT), Athens, pp. 343–354.
3. Arrival Deliverable D3.6., 2009. Improved Algorithms for Robust and Online Timetabling and for Timetable Information Updating. < http://arrival.cti.gr/uploads/3rd_year/ARRIVAL-Del-D3.6.pdf>.
4. Ben-Akiva, M.E., Gao, S., Wei, Z., Wen, Y., A dynamic traffic assignment model for highly congested urban networks. Transp. Res. Part C 24 (2012), 62–82.
5. Biscotti, F., et al. Market Guide for In-Memory Computing Technologies. 2015, Gartner Inc.
6. Buluc, A., Gilbert, J., Budak, C., Solving path problems on the GPU. J. Parallel Comput. 36:5–6 (2010), 241–253.
7. Cherkassky, B., Goldberg, A.V., Radzik, T., Shortest path algorithms: theory and experimental evaluation. Math. Program. 73 (1996), 129–174.
8. Costanzo, A., Faro, A., 2013. GPS sensing systems and fuzzy rules to improve urban navigation assistance and planning. In: Proc. of the 14th Int. Conf. on Mobile Data Management, Milano, pp. 154–159.
9. Costanzo, A., Faro, A., Giordano, D., Wi-City: living, deciding and planning using mobiles in intelligent cities. Proc of the 3rd Int. Conf. on Pervasive Embedded Computing and Communication Systems, Barcelona, 2013, 98–103.
10. Costanzo, A., Faro, A., Giordano, A., 2016. Implementing cyber physical social systems for smart cities: a semantic web perspective. In: Proc. of the 13th IEEE Consumer Communications & Networking Conference, Demonstration Session, Las Vegas, pp. 274–275.
11. ∗ based path finding in modern computer games. Int. J. Comput. Sci. Networks Security 11:1 (2011), 125–130.
12. Delling, D., Sanders, P., Schultes, D., Wagner, D., 2009. Engineering route planning algorithm. In: Lerner, J., Wagner, D., Zweig, K.A. (Eds.). Algorithmics, LNCS 5515, pp. 117–139.
13. Dornhofer, M., Brishof, W., Krajnc, E., 2014. Comparison of open source routing services with OpenStreetMap data with blind pedestrians. In: Proc. of FOSS4G ‘14, Bremen, pp. 1–6.
14. Floyd, L.R. Jr., Algorithm 97 – shortest path. Commun. ACM, 5(6), 1962, 345.
15. Falcocchio, J.C., Levinson, H.S., Road Traffic Congestion: A Concise Guide. 2015, Springer.
16. Faro, A., Giordano, D., Spampinato, C., Evaluation of the traffic parameters in a metropolitan area by fusing visual perceptions and CNN processing of webcam images. IEEE Trans. Neural Networks 19:6 (2008), 1108–1129.
17. Faro, A., Giordano, D., Spampinato, C., Integrating location tracking, traffic monitoring and semantics in a layered ITS architecture. IET Intel. Transport Syst. 5:3 (2011), 197–206.
18. Faro, A., Giordano, D., Spampinato, C., Adaptive background modelling integrated with luminosity sensors and occlusion processing for reliable vehicle detection. IEEE Trans. Intell. Transp. Syst. 12:4 (2011), 1398–1412.
19. Gallo, G., Pallottino, S., A new algorithm to find the shortest paths between all pairs of nodes. Discrete Appl. Math. 4:1 (1982), 23–35.
20. Garg, H., Rawat, P., An improved algorithm for finding all pair shortest path. Int. J. Comput. Appl. 47:25 (2012), 35–37.
21. Gazis, D.C., 2002. Traffic Theory, Kluewer.
22. Geroliminis, N., Daganzo, C.F., 2007. Macroscopic modeling of traffic in cities. In: Proc. of the86th Annual Transportation Meeting Research Board Washington D.C., pp. 1–20.
23. Goldberg, A.V., Harrelson, C., 2004. Computing the Shortest Path: A Search Meets Graph Theory. Technical Report MSR-TR-2004-24 Microsoft Research.
24. Gutenschwager, K., et al., 2012. The shortest path: comparison of different approaches and implementations for the automatic routing of vehicles. In: Proc. of the Winter Simulation Conference.
25. Immers, L.H., Logghe, S., 2003. Traffic Flow Theory. Katholieke Universiteit Leuven, Belgium. < http://www.kuleuven.be/traffic/dwn/H111part3.pdf>.
26. Jagadeesh, G.R., Srikanthan, T., Route computation in large road networks: a hierarchical approach. IET Intel. Transport Syst. 2:3 (2008), 219–227.
27. Kerner, B.S., Introduction to Modern Traffic Flow Theory and Control: The Long Road to Three-Phase Traffic Theory. 2009, Springer.
28. Kerner, B.S., The Physics of Traffic: Empirical Freeway Pattern Features, Engineering Applications, and Theory. 2010, Springer.
29. Kim, B., Jeong, S., A comparison of shortest path algorithms for origin-destination matrix generation on real road networks and an approximation approach. Comput. Indus. Eng. 56:1 (2009), 70–76.
30. Leng, J.F., Zeng, W., 2009. Improved Shortest Path Algorithm for Computing One-to-One Shortest Paths on Road Networks. In: Proc. of the 1st Int. Conf. on Information Science and Engineering, pp. 1979–1982.
31. Ma, J., 2013. Accelerating All-Pairs Shortest Path Search on GPUs Thesis (M.Phil.). Hong Kong University of Science and Technology. < http://repository.ust.hk/ir/Record/1783.1-62298>.
32. Marton, L., A label-setting algorithm for calculating shortest path trees in sparse networks, Hungarian. Alkalmazott Mat. Lapok 19:2 (1999), 115–132.
33. Menascè, D.A., Almeida, V., Dowdy, L., Performance by Design. 2004, Prentice Hall.
34. Murakami, K.J., 2013. Cyber Physical Social Systems. < www.jpgrid.org/event/2011/ws34_murakami. pdf>.
35. O'Brien, M., 2006. How MapQuest works. < http://pages.cs.wisc.edu/~dyer/cs540/handouts/how-MapQuest-works.pdf>.
36. Okuyama, T., Ino, F., Hagihara, K., A task parallel algorithm for finding all-pairs shortest paths using the GPU. Int. J. High Perform. Comput. Network. 7:2 (2012), 87–98.
37. Pallottino, S., Shortest-Path Methods. Networks 14:2 (1984), 257–267.
38. Pallottino, S., Scutellà, M.G., A new algorithm for re-optimizing shortest paths when the arc costs change. Operat. Res. Lett. 31:2 (2003), 149–160.
39. Pandey, V.S., Kumar, R., Singh, P.K., An optimized all pair shortest paths. Algorithm. Int. J. Comput. Appl. 2:3 (2010), 67–73.
40. Psofer, D., Efenkatis, A., Voisard, A., Wenk, C., Exploiting Road Network Properties in Efficient Short-Path Computation. 2009, Tec. Rep. RA Computer Technology Institute, Greece.
41. Quddus, M., Washington, S., Shortest path and vehicle trajectory aided map-matching for low frequency GPS data. Transp. Res. Part C 55 (2015), 328–339.
42. Rodríguez-Puente, R., Lazo-Cortés, M.S., Algorithm for Shortest Path Search in Geographic Information Systems by using Reduced Graphs. SpringerPlus, 2, 2013, 291.
43. Sadek, A.W., Qiao, C., Advances in computing and communications technologies and their impact on transportation science and applications. Transp. Res. Part C 45 (2014), 1–3.
44. Singh, A.K., Routing Techniques in Large Dynamic Road Network. Master Thesis, 2009, Computer Science & Engineering, Indian Institute of Technology, Bombay.
45. Srinivasan, T., Gangadharan, B.R., Gangadharan, S.A., Hayawardh, V., Scalable parallelization of all pairs shortest path algorithm for a high performance cluster environment. Proc. of the Int. Conf. on Parallel and Distributed Systems, 2, 2007, 1–8.
46. Stout, B., 1997. Smart Moves: Intelligent Pathfinding, Game Developer Magazine, July, 1–10.
47. Tao, S., Manolopoulos, V., Rodriguez, S., Rusu, A., Real-time urban traffic state estimation with A-GPS mobile phones as probes. J. Transport. Technol. 2:1 (2012), 22–31.
48. Van Rijn, J., 2004. Road Capacity, Indevelopment.
49. Wang, Z., Lu, M., Yuan, X., Zhang, J., van de Wetering, H., Visual traffic jam analysis based on trajectory data. IEEE Trans. Visual Comput. Graphics 19:12 (2013), 2159–2168.
50. Warshall, S., A theorem on Boolean matrices. J. ACM 9:1 (1962), 11–12.
51. Wie, B., Tobin, R.L., Bernstein, D., Friesz, T.L., A comparison of system optimum and user equilibrium dynamic traffic assignments with schedule delays. Transp. Res. Part C 3:6 (1995), 389–411.
52. Xiong, G., et al. Cyber-physical-social system in intelligent transportation. IEEE/CAA J. Automat. Sin. 2:3 (2015), 320–333.
53. ∗. Int. J. Geogr. Inform. Sci. 23:4 (2009), 531–543.
54. Zhan, B.F., Three fastest shortest path algorithms on real road networks: data structures and procedures. J. Geogr. Inform. Decis. Anal. 1:1 (1998), 69–82.
55. Zhan, B.F., Noon, C.E., Shortest path algorithms: an evaluation using real road networks. Transport. Sci. 32:1 (1998), 65–73.