Multilevel Graph Partitioning Algorithm for Dynamic Airspace Configuration

In this paper, a multilevel graph partitioning algorithm is developed for Dynamic Airspace Configuration which partitions the graph model of airspace with given user defined constraints and hence provides the user more flexibility and control over various partitions. We formulate the airspace configuration problem as a graph partitioning problem to balance the sub-graph (sector) workload while satisfying the capacity constraint by using a graph model which accurately represents the air route structure and air traffic in the National Airspace system (NAS). Currently the spectral clustering method is widely in use for such type of partitioning problems. However it does not provide the user the flexibility to take into consideration the structure of the graph (e.g. if a group of vertices needs to be in the same group, if a particular edge or link should not be allowed to be cut etc.). In terms of air traffic management, vertices represent airports and waypoints. Some of the major (busy) airports need to be given more importance and hence treated separately. Thus our algorithm takes into account the air route structure while finding a balance between sector workloads. Since graph partitioning algorithms usually face problems such as disconnected sub-graphs and unbalanced partitions, an algorithm is proposed to refine these partitions. The performance of the proposed algorithm is validated with Enhanced Traffic Management System (ETMS) air traffic data.

[1]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[2]  Marc Schoenauer,et al.  Genetic algorithms for partitioning air space , 1994, Proceedings of the Tenth Conference on Artificial Intelligence for Applications.

[3]  Banavar Sridhar,et al.  Initial Concepts for Dynamic Airspace Configuration , 2007 .

[4]  Anthony J. Masalonis,et al.  DYNAMIC DENSITY AND COMPLEXITY METRICS FOR REALTIME TRAFFIC FLOW MANAGEMENT , 2003 .

[5]  Parimal Kopardekar,et al.  Analysis of Current Sectors Based on Traffic and Geometry , 2008 .

[6]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[7]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[8]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

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

[10]  George L. Donohue,et al.  Temporal and Spatial Distribution of Airspace Complexity for Air Traffic Controller Workload-Based Sectorization , 2004 .

[11]  David S. Johnson,et al.  Some simplified NP-complete problems , 1974, STOC '74.

[12]  Marc Schoenauer,et al.  Airspace sectoring by evolutionary computation , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[13]  Inseok Hwang,et al.  An Algorithm for Dynamic Airspace Configuration Based on the Air Route Structure , 2009 .

[14]  Inseok Hwang,et al.  A Spectral Clustering Based Algorithm for Dynamic Airspace Configuration , 2009 .

[15]  Min Xue.  Airspace Sector Redesign Based on Voronoi Diagrams , 2008 .

[16]  Inseok Hwang,et al.  Graph-Based Algorithm for Dynamic Airspace Configuration , 2010 .