Centrality measures in transportation networks for Unpad campus route

Abstract

Centrality measurement still becomes an interesting research topic recently, including its relation to transportation’s effectiveness and efficiency. A transportation network can be expressed in the form of a graph so that even a level of centrality for each vertex of a complex transportation network can be simply analyzed. There have been various developments/modifications of methods on centrality measures in transportation networks. The offered methods show the different points of view regarding which vertices are most important in the transport network. In this research, the study of some centrality measures in the transportation network is discussed. A numerical experiment of some centrality measures implemented to Universitas Padjadjaran (Unpad) campus route as a network is given. The comparisons are done to explore the performance of each method. The calculation is done using Python software with NetworkX library. The results for Unpad campus route show that some vertices (locations) are more prior than another.