# Trafforithm - A Traffic-aware Shortest Path Algorithm in Real Road Networks with Traffic Influence Factors

### Lin Qi, Markus Schneider

#### Abstract

The shortest path computation between two given locations in a road network is an important problem that finds applications in a wide range of fields. There has been a lot of research efforts targeting at the preciseness and performance of finding shortest paths in road networks. However, rarely of them have really taken into account the influence of traffic factors such as traffic lights, road conditions, traffic jams and turning cost. In other words, existing approaches are rather purely based on the topology of the network, but forgot that there are multiple factors in a real road network that impact the accuracy of the algorithm. The contribution of our paper is twofold. First, we present a generic two-layered framework for moving objects in road networks environment and demonstrate the important role of traffic factors on path finding and route planning. Second, we develop an efficient parallel shortest path algorithm in road networks with the consideration of traffic influence factors. Detailed analysis presented shows that our parallel TRAFFic-aware shortest path algORITHM (Trafforithm), is accurate and practical.

#### References

- Awasthi, A., Lechevallier, Y., Parent, M., and Proth, J. M. (2005). Rule based prediction of fastest paths on urban networks. In 8th Intl. IEEE Conference on Intelligent Transportation Systems.
- Barrat, A., Barthélemy, M., Pastor-Satorras, R., and Vespignani, A. (2004). The architecture of complex weighted networks. In Proc Natl Acad Sci, volume 101, pages 3747-3752.
- Bast, H., Funke, S., and Matijevic, D. (2006). Transit: ultrafast shortest-path queries with linear-time preprocessing. In Proc. of the 9th DIMACS Implementation Challenge, pages 175-192.
- Bast, H., Funke, S., Sanders, P., and Schultes, D. (2007). Fast routing in road networks with transit nodes. Science, 316(5824):566.
- Dantzig, G. B. (1962). Linear Programming and Extensions. Princeton University Press.
- Demiryurek, U., Banaei-Kashani, F., and Shahabi, C. (2010). A case for time-dependent shortest path computation in spatial networks. In Proceedings of the 18th SIGSPATIAL Intl. Conf. on Advances in Geographic Information Systems, pages 474-477.
- Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271.
- Freeman, L. (1978). Centrality in social networks: Conceptual clarification. In Social Networks, volume 1, pages 215-239.
- Geary, M. R. and Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of Incompleteness. W.H. Freeman and Company.
- Goldberg, A. V. and Harrelson, C. (2005). Computing the shortest path: A* search meets graph theory. In SODA, pages 156-165.
- Hart, P. E., Nilsson, N., and Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. In IEEE Transactions on Systems Science and Cybernetics, volume 4, pages 100-107.
- Hilger, M., E. Köhler, R. H. M., and Schilling, H. (2006). Fast point-to-point shortest path computations with arc-flags. In Proc. of the 9th DIMACS Implementation Challenge, pages 73-92.
- Jiang, B. (2007). A topological pattern of urban street networks: universality and peculiarity. Physica A: Stat. Mechanics and its Applications, 384(2):647-655.
- Jiang, B. and Liu, X. (2011). Computing the fewest-turn map directions based on the connectivity of natural roads. International Journal of Geographical Information Science, 25(7):1069-1082.
- Kanjilal, V. and Schneider, M. (2011). Modeling and querying spatial networks in databases. JMPT.
- Kanoulas, E., Y. Du, T. X., and Zhang, D. (2006). Finding fastest paths on a road network with speed patterns. In 22nd International Conference on Data Engineering.
- Lu, E. H.-C., Lin, C.-C., and Tseng, V. S. (2008). Mining the shortest path within a travel time constraint in road network environments. In 11th Intl. IEEE Conference on Intelligent Transportation Systems.
- Qi, L. and Schneider, M. (2012). Monet: Modeling and querying moving objects in spatial networks. In 3rd ACM SIGSPATIAL Int. Workshop on GeoStreaming.
- Qi, L. and Schneider, M. (2014). Realtime response of shortest path computation. In 7th ACM SIGSPATIAL International Workshop on Computational Transportation Science (IWCTS), volume 4.
- S? imek, F. and S? imec?ek, I. (2011). Improvement of shortest path algorithms through graph partitioning. In Proceedings of Intl. Conf. Presentation of Mathematics'11, pages 131-137, Liberec. Technical University.
- Tang, Y. and Y. Zhang, H. C. (2008). A parallel shortest path algorithm based on graph-partitioning and iterative correcting. In 10th IEEE International Conference on High Performance Computing and Communications, pages 155-161.

#### Paper Citation

#### in Harvard Style

Qi L. and Schneider M. (2015). **Trafforithm - A Traffic-aware Shortest Path Algorithm in Real Road Networks with Traffic Influence Factors** . In *Proceedings of the 1st International Conference on Geographical Information Systems Theory, Applications and Management - Volume 1: GISTAM,* ISBN 978-989-758-099-4, pages 105-112. DOI: 10.5220/0005350701050112

#### in Bibtex Style

@conference{gistam15,

author={Lin Qi and Markus Schneider},

title={Trafforithm - A Traffic-aware Shortest Path Algorithm in Real Road Networks with Traffic Influence Factors},

booktitle={Proceedings of the 1st International Conference on Geographical Information Systems Theory, Applications and Management - Volume 1: GISTAM,},

year={2015},

pages={105-112},

publisher={SciTePress},

organization={INSTICC},

doi={10.5220/0005350701050112},

isbn={978-989-758-099-4},

}

#### in EndNote Style

TY - CONF

JO - Proceedings of the 1st International Conference on Geographical Information Systems Theory, Applications and Management - Volume 1: GISTAM,

TI - Trafforithm - A Traffic-aware Shortest Path Algorithm in Real Road Networks with Traffic Influence Factors

SN - 978-989-758-099-4

AU - Qi L.

AU - Schneider M.

PY - 2015

SP - 105

EP - 112

DO - 10.5220/0005350701050112