A transportation network stability analysis method based on betweenness centrality entropy maximization

In order to analyze the structural stability of transportation networks, a dynamic structure optimization method combining with betweenness and network entropy, named Fast Betweenness Entropy Maximization (Fast BEM), is proposed in this paper, which uses iterative calculation process to enhance stability of network structure, and finally reaches a stable structure of transportation networks. The Fast BEM improves the speed of convergence on the basis of the existing open shortest path first algorithm, despite an increase in the work done in each optimization iteration. But the number of optimized iterations and the running time are reduced in general. Consequently, the stable structure can be found more quickly. The experiments show that by using the Fast BEM, the convergence speed tends to be stable to reduce volatility, and the effectiveness of this algorithm is verified.

[1]  Xiao-Yuan He,et al.  Degree dependence entropy descriptor for complex networks , 2013 .

[2]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[3]  Kara M. Kockelman,et al.  Maximum Entropy Method for Subnetwork Origin–Destination Trip Matrix Estimation , 2010 .

[4]  Tan Qing-mei.  A Study of the Stability of Emergency Logistics Network Based on Network Entropy , 2012 .

[5]  Krishna M. Sivalingam,et al.  A Centrality Entropy Maximization Problem in Shortest Path Routing Networks , 2016, Comput. Networks.

[6]  L. da F. Costa,et al.  Characterization of complex networks: A survey of measurements , 2005, cond-mat/0505185.

[7]  N C Das,et al.  Traffic network and distribution of cars: maximum-entropy approach , 2000 .

[8]  R. Solé,et al.  Information Theory of Complex Networks: On Evolution and Architectural Constraints , 2004 .

[9]  Yong Deng,et al.  Local structure entropy of complex networks , 2014, ArXiv.

[10]  Li Wang,et al.  Signal sub-control-area division of traffic complex network based on nodes importance assessment , 2011, Proceedings of the 30th Chinese Control Conference.

[11]  Yu Li.  Maximum Entropy Method and It's Application in Probability Density Function of Traffic Flow , 2001 .

[12]  C. S. Fisk,et al.  ON COMBINING MAXIMUM ENTROPY TRIP MATRIX ESTIMATION WITH USER OPTIMAL ASSIGNMENT , 1988 .

[13]  Yuejin Tan,et al.  Heterogeneity of Scale-free Networks , 2007 .

[14]  Yongtang Shi,et al.  Bounds for degree-based network entropies , 2015, Appl. Math. Comput..