Laplacian energy maximizationfor multi-layer air transportation networks
多层航空网络拉普拉斯能量最大化问题(英文)作者机构:School of Transportation Southeast University Nanjing 210096 China Department of Computer Science University of Victoria Victoria V8W3P6 Canada College of Civil Aviation Nanjing University of Aeronautics and Astronautics Nanjing 210016 China
出 版 物:《Journal of Southeast University(English Edition)》 (东南大学学报(英文版))
年 卷 期:2017年第33卷第3期
页 面:341-347页
核心收录:
基 金:The National Natural Science Foundation of China(No.61573098,71401072) the Natural Science Foundation of Jiangsu Province(No.BK20130814)
主 题:air transportation network Laplacian energy robustness multi-layer networks
摘 要:To increase airspace capacity, alleviate flight delay,and improve network robustness, an optimization method of multi-layer air transportation networks is put forward based on Laplacian energy maximization. The effectiveness of taking Laplacian energy as a measure of network robustness is validated through numerical experiments. The flight routes addition optimization model is proposed with the principle of maximizing Laplacian energy. Three methods including the depth-first search( DFS) algorithm, greedy algorithm and Monte-Carlo tree search( MCTS) algorithm are applied to solve the proposed problem. The trade-off between system performance and computational efficiency is compared through simulation experiments. Finally, a case study on Chinese airport network( CAN) is conducted using the proposed model. Through encapsulating it into multi-layer infrastructure via k-core decomposition algorithm, Laplacian energy maximization for the sub-networks is discussed which can provide a useful tool for the decision-makers to optimize the robustness of the air transportation network on different scales.