A constraint-programming formulation for dynamic airspace sectorization

In this paper we consider the dynamic airspace sectorization problem (DASP) where airspace is partitioned into a number of sectors, each sector being assigned to a team of air traffic controllers. The objective of DASP is to balance the controllers' workload among the sectors and to simultaneously minimize the coordination workload between adjacent sectors. This problem is closely related to the graph partitioning problems. However, some specific constraints have to be taken into account (e.g., aircraft can not enter twice the same sector; aircraft have to stay in each crossed sector at least a given amount of time, etc.) and they make it difficult to use the most popular graph partitioning techniques of the literature. To solve the DASP, we introduce a constraint-programming formulation that can compute optimal solution for "small" instances of problem. A heuristic based on the notion of gain of Kernighan/Lin algorithm for graph partitioning is also introduced for finding a reasonable good initial solution for large size instances in a small amount of time. We also show how the constraint-programming formulation is used to re-optimize locally this initial solution.

[1]  Daniel Delahaye.  Optimisation de la sectorisation de l'espace aérien par algorithmes génétiques , 1995 .

[2]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[3]  Robert G. Reynolds,et al.  Genetic Algorithms for Automatic Regrouping of Air Traffic Control Sectors , 1995 .

[4]  Bruce Hendrickson,et al.  An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations , 1995, SIAM J. Sci. Comput..

[5]  Bruce Hendrickson,et al.  An empirical study of static load balancing algorithms , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

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

[7]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[8]  Chia-Hoang Lee,et al.  Comments on Mohr and Henderson's Path Consistency Algorithm , 1988, Artif. Intell..

[9]  Gary L. Miller,et al.  Geometric mesh partitioning: implementation and experiments , 1995, Proceedings of 9th International Parallel Processing Symposium.

[10]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[11]  M Barbara,et al.  A Tutorial on Constraint Programming , 1995 .

[12]  Gary L. Miller,et al.  Geometric Mesh Partitioning: Implementation and Experiments , 1998, SIAM J. Sci. Comput..

[13]  P. Berlandier.  Improving domain filtering using restricted path consistency , 1995, Proceedings the 11th Conference on Artificial Intelligence for Applications.

[14]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

[15]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[16]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

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

[18]  Gilles Gawinowski,et al.  Sector-Less Air Traffic Management , 2001 .

[19]  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).

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[22]  Alain Colmerauer,et al.  An introduction to Prolog III , 1989, CACM.

[23]  Jean-francois Puget,et al.  A C++ implementation of CLP , 1997 .

[24]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..