Efficient Computation of Time-Dependent Centralities in Air Transportation Networks
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.
KeywordsOptimal Path Departure Event Centrality Index Arrival Event Transfer Centrality
Unable to display preview. Download preview PDF.
- 8.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)Google Scholar
- 11.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)Google Scholar
- 14.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)Google Scholar
- 15.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)Google Scholar
- 16.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.4Google Scholar