Modelling and analysis of transportation networks using complex networks: Poland case study
DOI:
https://doi.org/10.5604/08669546.1185207Keywords:
transportation network, modelling, complex networks, network analysisAbstract
In the paper a theoretical bases and empirical results deal with analysis and modelling of transportation networks in Poland using complex networks have been presented. Properties of complex networks (Scale Free and Small World) and network's characteristic measures have been described. In this context, results of empirical researches connected with characteristics of passenger air links network, express railway links network (EuroCity and InterCity) and expressways/highways network in Poland have been given. For passenger air links network in Poland results are compared with the same networks in USA, China, India, Italy and Spain. In the conclusion some suggestions, observations and perspective dealing with complex network in transportation networks have been presented.
References
BARABÁSI, A. and ALBERT, R., 1999. Emergence of Scaling in Random Networks. Science, 286(5439), pp. 509-512.
BARTOSIAK, C., KASPRZYK, R. and TARAPATA, Z., 2011. Application of Graphs and Networks Similarity Measures for Analyzing Complex Networks. Biuletyn Instytutu Systemów Informatycznych, 7, pp. 1- 7.
BERCHE, B., FERBER, C.V., HOLOVATCH, T. and HOLOVATCH, Y., 2012. Transportation Network Stability: A Case Study Of City Transit. Advances in Complex Systems, 15(supp01), pp. 1-18.
BRANDES, U., 2001. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25(2), pp. 163-177.
CHEUNG, D.P. and GUNES, M.H., 2012. A Complex Network Analysis of the United States Air Transportation, Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 26-29 August, 2012, Kadir Has University, Istanbul, Turkey 2012, pp. 699- 701.
ERDŐS, P. and RÉNYI, A., 1959. On random graphs I. Publ.Math.Debrecen, 6, pp. 290-297.
GEPHI webpage, The Open Graph Viz Platform. Available: http://gephi.org/.
HAGE, P. and HARARY, F., 1995. Eccentricity and centrality in networks. Social networks, 17(1), pp. 57-63.
LATAPY, M., 2008. Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoretical Computer Science, 407(1–3), pp. 458-473.
LIMA, M., 2004-last update, Transportation Routes. Available: http://www.mslima.com/mfadt/thesis/2004/0 8/transportation-routes.html.
TARAPATA, Z. and KASPRZYK, R., 2009. An application of multicriteria weighted graph similarity method to social networks analyzing, Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining, 20- 22.07.2009 2009, IEEE Computer Society, pp. 366-368.
TARAPATA, Z. and KASPRZYK, R., 2010. Graph-based optimization method for information diffusion and attack durability in networks, Rough Sets and Current Trends in Computing, Lecture Notes in Artificial Intelligence, 6086 (2010) 2010, Springer- Verlag Berlin Heidelberg, pp. 698-709.
TRAVENÇOLO, B.A.N. and DA F. COSTA, L., 2008. Accessibility in complex networks. Physics Letters A, 373(1), pp. 89-95.
VON FERBER, C., HOLOVATCH, T., HOLOVATCH, Y. and PALCHYKOV, V., 2009. Public transport networks: empirical analysis and modeling. The European Physical Journal B, 68(2), pp. 261-275.
WANG, J., MO, H., WANG, F. and JIN, F., 2011. Exploring the network structure and nodal centrality of China’s air transport network: A complex network approach. Journal of Transport Geography, 19(4), pp. 712-721.
WATTS, D.J. and STROGATZ, S.H., 1998. Collective dynamics of ‘small-world’ networks. Nature, 393(6684), pp. 440-442.
XIE, F. and LEVINSON, D., 2009. Topological evolution of surface transportation networks. Computers, Environment and Urban Systems, 33(3), pp. 211-223.
ZANIN, M. and LILLO, F., 2013. Modelling the air transport with complex networks: A short review. The European Physical Journal Special Topics, 215(1), pp. 5-21.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Archives of Transport journal allows the author(s) to hold the copyright without restrictions.
This work is licensed under a Creative Commons Attribution 4.0 International License.