Algebraic Connectivity Optimization of Large Scale and Directed Air Transportation Network

Abstract In transportation networks the robustness of a network regarding nodes and links failures is a key factor for its design. A common way to measure the robustness of a network is to evaluate its algebraic connectivity. In our previous work we formulated a new air transportation network model and showed the algebraic connectivity optimization problem is important because the two sub-problems of adding edges and choosing edge weights can not be treated separately. We presented a method to find both the edges and the corresponding weights in order to optimize the small scale network algebraic connectivity, which is a measure for robustness. In this paper we propose the cluster decomposition method to solve the larger size network problem. Moreover, the algebraic connectivity optimization for directed air transportation network is discussed. Simulations are performed for both large scale problem and directed network problem.

[1]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[2]  B. Mohar.  THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

[3]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on a Graph , 2004, SIAM Rev..

[4]  Roger Guimerà,et al.  Modeling the world-wide airport network , 2004 .

[5]  C. Wu.  Algebraic connectivity of directed graphs , 2005 .

[6]  Stephen P. Boyd,et al.  Growing Well-connected Graphs , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[7]  Stephen P. Boyd.  Convex optimization of graph Laplacian eigenvalues , 2006 .

[8]  Stephen P. Boyd,et al.  The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem , 2006, SIAM Rev..

[9]  Alexandre M. Bayen,et al.  A Weighted-Graph Approach for Dynamic Airspace Configuration , 2007 .

[10]  A. Jamakovic,et al.  On the relationship between the algebraic connectivity and graph's robustness to node and link failures , 2007, 2007 Next Generation Internet Networks.

[11]  N. Abreu.  Old and new results on algebraic connectivity of graphs , 2007 .

[12]  Rex K. Kincaid,et al.  Toward Optimal Transport Networks , 2008 .

[13]  Christoph Helmberg,et al.  Embedded in the Shadow of the Separator , 2008, SIAM J. Optim..

[14]  Piet Van Mieghem,et al.  On the Robustness of Complex Networks by Using the Algebraic Connectivity , 2008, Networking.

[15]  Peng Wei,et al.  Weighted Algebraic Connectivity: An Application to Airport Transportation Network , 2011 .

[16]  Dengfeng Sun,et al.  Algebraic connectivity optimization of the air transportation network , 2012, 2012 American Control Conference (ACC).