Abstract
We introduce indices of centrality to analyze air transportation networks which represent the importance of airports and individual flights dependent on the time of the day (time-dependent centrality indices). Our centrality indices are based on earliest arrival paths with a minimum number of transfers in a time- and event-dependent network model. This means, that all paths correspond to real connections, in particular with transfers which obey minimum transfer times between flights. While the straight-forward computation of these indices is quite expensive, we provide efficient algorithms for the centrality computation. To this end, we construct a certain sequence of pairwise disjoint profile graphs representing all relevant paths by exploiting a special kind of subpath optimality. This avoids unnecessary repeated computations of all optimal time-dependent multi-criteria paths and allows us to use single criterion path queries for the earliest arrival time (without path construction). We have tested our method with original schedule data of 2010 provided by Official Airlines Guide (OAG) on the complete world-wide airport network. Our approach yields a speed-up over the straight-forward centrality computation by a factor of about 100 for the world-wide network.
This work was partially supported by the DFG Priority Programme SPP 1307 Algorithm Engineering, grant Mu 1482/4-2. A full version of this paper (including proofs) is available as Technical Report 2010/05, Martin-Luther-University Halle-Wittenberg, Institute of Computer Science.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Balcan, D., Colizza, V., Gonçalves, B., Hu, H., Ramasco, J., Verspignani, A.: Multiscale mobility networks and the spatial spreading of infectious diseases. PNAS 106, 21484–21489 (2009)
Colizza, V., Barthélemy, A.B.M., Vespignani, A.: The role of the airline transportation network in the prediction and predictability of global epidemics. PNAS 103, 2015–2020 (2006)
Koschützki, D., Lehmann, K.A., Peeters, L., Richter, S., Tenfelde-Podehl, D., Zlotowski, O.: Centrality indices. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol. 3418, pp. 16–61. Springer, Heidelberg (2005)
Jacob, R., Koschützki, D., Lehmann, K.A., Peeters, L., Tenfelde-Podehl, D.: Algorithms for centrality indices. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol. 3418, pp. 62–82. Springer, Heidelberg (2005)
Borgatti, S., Everett, M.: A graph-theoretic perspective on centrality. Social Networks 28, 466–484 (2006)
Brandes, U.: A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25, 163–177 (2001)
Brandes, U., Pich, C.: Centrality estimation in large networks. I. J. Bifurcation and Chaos 17, 2303–2318 (2007)
Geisberger, R., Sanders, P., Schultes, D.: Better approximation of betweenness centrality. In: Munro, J.I., Wagner, D. (eds.) ALENEX, pp. 90–100. SIAM, Philadelphia (2008)
Guimerà, R., Amaral, L.: Modeling the world-wide airport network. European Physical Journal B 38, 381–385 (2004)
Guimerà, R., Mossa, S., Turtschi, A., Amaral, L.: The worldwide air transportation network: Anomalous centrality, community structure, and cities’ global roles. PNAS 102, 7794–7799 (2005)
Burghouwt, G., Redondi, R.: Connectivity in air transport networks: models, measures and applications. Technical Report 1/09, Department of Economics and technology Management, University of Bergamo (2009)
Malighetti, P., Paleari, S., Redondi, R.: Connectivity of the European airport network: “self-help hubbing” and business implications. Journal of Air Transport Management 14, 53–65 (2008)
Paleari, S., Redondi, R., Malighetti, P.: A comparative study of airport connectivity in China, Europe and US: Which network provides the best service to passengers? Transportation Research Part E: Logistics and Transportation Review 46, 198–210 (2010)
Berger, A., Müller-Hannemann, M.: Subpath-optimality of multi-criteria shortest paths in time-dependent and event-dependent networks. Technical report 2009/1, Martin-Luther-Universität Halle-Wittenberg, Institute of Computer Science (2009)
Brodal, G.S., Jacob, R.: Time-dependent networks as models to achieve fast exact time-table queries. In: Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003). Electronic Notes in Theoretical Computer Science, vol. 92. Elsevier, Amsterdam (2004)
Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient models for timetable information in public transportation systems. ACM Journal of Experimental Algorithmics 12 (2007); Article 2.4
Cook, K., Hasley, E.: The shortest route through a network with time-dependent internodal transit times. Journal of Mathematical Analysis and Applications 14, 493–498 (1966)
Dreyfus, S.: An appraisal of some shortest-path algorithms. Operations Research 17, 395–412 (1969)
Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM 37, 607–625 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berger, A., Müller-Hannemann, M., Rechner, S., Zock, A. (2011). Efficient Computation of Time-Dependent Centralities in Air Transportation Networks. In: Katoh, N., Kumar, A. (eds) WALCOM: Algorithms and Computation. WALCOM 2011. Lecture Notes in Computer Science, vol 6552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19094-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-19094-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19093-3
Online ISBN: 978-3-642-19094-0
eBook Packages: Computer ScienceComputer Science (R0)