Skip to main content
SpringerLink
Log in

Configuration of airspace sectors for balancing air traffic controller workload

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Balas, E. (1974). Disjunctive programming: Properties of the convex hull of feasible points (Management Science Research Report 348). GSIA, Carnegie Mellon University.

  • Basu, A., Mitchell, J. S. B., & Sabhnani, G. (2008). Geometric algorithms for optimal airspace design and air traffic controller workload balancing. In Proceedings of the tenth workshop on algorithm engineering and experiments. SIAM Proceedings in Applied Mathematics (pp. 75–89).

    Google Scholar 

  • Bazaraa, M. S., Sherali, H. D., & Shetty, C. M. (2006). Nonlinear programming: theory and algorithms, 3rd edn. New York: Wiley.

    Book  Google Scholar 

  • Delahaye, D., & Puechmorel, S. (2006). 3D airspace sectoring by evolutionary computation. In Proceedings of the 8th annual conference on genetic and evolutionary computation, Seattle, WA, July 8–12 (pp. 1637–1644).

    Chapter  Google Scholar 

  • Delahaye, D., Alliot, J.-M., Schoenauer, M., & Farges, J.-L. (1994). Genetic algorithms for partitioning air space. In 10th IEEE conference on artificial intelligence applications, San Antonio, TX, March 1–4.

    Google Scholar 

  • Doble, N., Hoffman, R., Krozel, J., Lee, P., Mercer, J., Gore, B., Smith, N., Lee, K., & Kopardekar, P. (2008). Current airspace configuration practices and their implications for future airspace concepts. In 8th AIAA aviation technology, integration, and operations conference, Anchorage Alaska, September AIAA-2008-8939.

    Google Scholar 

  • FAA (2002). National airspace redesign strategic management plan. Federal Aviation Administration. Internet website: http://www.faa.gov/air_traffic/nas_redesign/.

  • FAA (2003). Advisory circular 90–99: high altitude airspace redesign phase I. Federal Aviation Administration. Internet website: http://www.faa.gov/atpubs.

  • FAA (2005). National severe weather playbook. Federal Aviation Administration. Internet website: http://www.fly.faa.gov/playbook/pbindex.html.

  • Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1974). Some simplified NP-complete problems. In STOC ’74: Proceedings of the sixth annual ACM symposium on theory of computing (pp. 47–63). New York: ACM.

    Chapter  Google Scholar 

  • Hoffmann, R., & Prete, J. (2008). Principles of airspace tube design for dynamic airspace configuration. In 8th AIAA aviation technology, integration, and operations conference, Anchorage Alaska, September AIAA-2008-8939.

    Google Scholar 

  • Klein, A., Kopardekar, P., Rodgers, M. D., & Kaing, H. (2007). Airspace playbook: dynamic airspace reallocation coordinated with the national severe weather playbook. In AIAA aviation technology, integration and operations (ATIO) conference, Belfast, UK.

    Google Scholar 

  • Klein, A., Rodgers, M. D., & Kaing, H. (2008). Dynamic FPAs: A new method for dynamic airspace configuration. In Integrated communications, navigation and surveillance conference, Bethesda, MD, May 5–7 (pp. 1–11).

    Chapter  Google Scholar 

  • Koehler, G. J. (1990). Considerations for mathematical programming models in discriminant analysis. Managerial and Decision Economics, 11(4), 227–234.

    Article  Google Scholar 

  • Kopardekar, P., Bilimoria, K., & Sridhar, B. (2007). Initial concepts for dynamic airspace configuration. In 7th AIAA aviation technology, integration and operations conference (ATIO), Belfast, Northern Ireland, September 18–20.

    Google Scholar 

  • Martinez, S., Chatterji, G., Sun, D., & Bayen, A. (2007). A weighted-graph approach for dynamic airspace configuration. In AIAA guidance, navigation, and control conference, Hilton Head, SC, August 20–23.

    Google Scholar 

  • McNally, P., & Thipphavong, D. (2008). Automated separation assurance in the presence of uncertainty. In 26th international congress of the aeronautical sciences, Anchorage, Alaska, September 14–19.

    Google Scholar 

  • Mitchell, J. S. B., Sabhnani, G., Krozel, J., Hoffman, B., Yousefi, A., & Kopardekar, P. (2008). Dynamic airspace configuration management based on computational geometry techniques. In AIAA guidance, navigation, and control conference, Honolulu, HI, August AIAA-2008-7225.

    Google Scholar 

  • Raghavan, P., & Thompson, C. D. (1987). Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7, 365–374.

    Article  Google Scholar 

  • Rubin, P. A. (1997). Solving mixed integer classification problems by decomposition. Annals of Operations Research, 74, 51–64.

    Article  Google Scholar 

  • Sherali, H. D., & Adams, W. P. (1990). A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics, 3(3), 411–430.

    Article  Google Scholar 

  • Sherali, H. D., & Adams, W. P. (1994). A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Applied Mathematics, 52, 83–106.

    Article  Google Scholar 

  • Sherali, H. D., & Shetty, C. M. (1980). Lecture Notes in Economics and Mathematical Systems: Vol. 181. Optimization with Disjunctive Constraints. Berlin: Springer.

    Book  Google Scholar 

  • Sherali, H. D., Smith, J. C., Trani, A. A., & Sale, S. (2000). National airspace sector occupancy and conflict analysis models for evaluating scenarios under the free-flight paradigm. Transportation Science, 34(4), 321–336.

    Article  Google Scholar 

  • Sherali, H. D., Staats, R. W., & Trani, A. A. (2003). An airspace planning and collaborative decision-making model: Part I—Probabilistic conflicts, workload, and equity considerations. Transportation Science, 37(4), 434–456.

    Article  Google Scholar 

  • Sherali, H. D., Staats, R. W., & Trani, A. A. (2006). An airspace planning and collaborative decision-making model: Part II—Cost model, data considerations, and computations. Transportation Science, 40(2), 147–164.

    Article  Google Scholar 

  • Sherali, H. D., Hill, J. M., McCrea, M. V., & Trani, A. A. (2009). Integrating slot-exchange, safety, capacity, and equity mechanisms within an airspace flow program. Manuscript, Grado department of industrial and systems engineering, Virginia Tech, Blacksburg, VA.

  • Tien, A., & Hoffmann, R. (2009). Optimizing airspace sectors for varying demand patterns using multi-controller staffing. In 8th USA/Europe air traffic management research and development seminar, June.

    Google Scholar 

  • Trandac, H., Baptiste, P., & Duong, V. (2002). A constraint-programming formulation for dynamic airspace sectorization. In Proceedings of the 21st digital avionics systems conference, Irvine, CA, October 27–31 (pp. 1.C.5-1–1.C.5.-11).

    Google Scholar 

  • Weisstein, E. W. (2009). Voronoi diagram, From MathWorld–A Wolfram Web Resource. http://mathworld.wolfram.com/VoronoiDiagram.html.

  • Xue, M. (2008). Airspace sector redesign based on Voronoi diagrams. In AIAA guidance, navigation, and control conference, Honolulu, HI, August 18–21.

    Google Scholar 

  • Yousefi, A., & Donohue, G. L. (2004). Temporal and spatial distribution of airspace complexity for air traffic controller workload-based sectorization. In AIAA 4th aviation technology, integration and operations (ATIO) forum, Chicago, IL, September 20–22.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Grado Department of Industrial and Systems Engineering, 250 Durham Hall, Mail Code 0118, Blacksburg, VA, 24060, USA

    Hanif D. Sherali & Justin M. Hill

Authors
  1. Hanif D. Sherali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Justin M. Hill
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hanif D. Sherali.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sherali, H.D., Hill, J.M. Configuration of airspace sectors for balancing air traffic controller workload. Ann Oper Res 203, 3–31 (2013). https://doi.org/10.1007/s10479-011-0837-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-011-0837-z

Keywords

Search

Navigation