Abstract

In this paper, we consider the problem of reconfiguring a section of the national airspace into appropriate sectors from the viewpoint of balancing the predicted air traffic controller workload. The given section of the airspace is specified as a convex polygon in two-dimensions (or a union of such structures), and contains a discretized set of weighted grid points representing localized sub-regions, where the weights reflect the associated air traffic controller monitoring and conflict resolution workloads. We describe four variants of a mixed-integer programming-based algorithmic approach to recursively partition the specified airspace region so as to balance the total weight distribution within each resulting sector. In addition, we augment the proposed model to further accommodate inter-sector coordination workload within this partitioning process, which accounts for the number of flight hand-offs between adjacent sectors. Some illustrative examples are presented to assess the proposed methodology and to investigate the relative computational efficiency and the quality of solutions produced by each algorithmic variant. One competitive procedure is then used to configure a region of airspace over the U.S. using realistic flight data. The main purpose of this work is to provide some modeling concepts and insights to complement the rich body of existing literature on this topic.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call