An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity Considerations

In this paper, we present an airspace planning model (APM) that has been developed for use in both tactical and strategic planning contexts under various airspace scenarios. Given a set of flights for a particular time horizon, along with (possibly several) alternative flight-plans for each flight that are based on delays and diversions, due to special-use airspace (SUA) restrictions prompted by launches at spaceports or adverse weather conditions, this model prescribes a set of flight-plans to be implemented. The model formulation seeks to minimize and delay fuel-cost-based objective function, subject to the constraints that each flight is assigned one of the designated flight-plans, and that the resulting set of flight-plans satisfies certain specified workload, safety, and equity criteria. These requirements ensure that the workload for air-traffic controllers in each sector is held under a permissible limit, that any potential conflicts are routinely resolvable, and that the various airlines involved derive equitable levels of benefits from the overall implemented schedule. To solve the resulting 0--1 mixed-integer programming problem more effectively using commercial software (e.g., CPLEX-MIP), we explore the use of reformulation techniques designed to more closely approximate the convex hull of feasible solutions to the problem. We also prescribe a polynomial-time heuristic procedure that is demonstrated to provide solutions to the problem within 0.01% of optimality. Computational results are reported on several scenarios based on actual flight data obtained from the Federal Aviation Administration (FAA) to demonstrate the efficacy of the proposed approach for air-traffic management (ATM) purposes.

[1]  Heinz Erzberger,et al.  Direct-To Tool for En Route Controllers , 2001 .

[2]  E. Andrew Boyd,et al.  TRAFFIC FLOW MANAGEMENT MODELING WITH THE TIME ASSIGNMENT MODEL. , 1993 .

[3]  Amedeo R. Odoni,et al.  Existing and Required Modeling Capabilities for Evaluating ATM Systems and Concepts , 1997 .

[4]  Dimitris Bertsimas,et al.  The Air Traffic Flow Management Problem with Enroute Capacities , 1998, Oper. Res..

[5]  Hanif D. Sherali,et al.  A Quadratic Partial Assignment and Packing Model and Algorithm for the Airline Gate Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[6]  John M Falker CONFLICT ANALYSIS OF AIR AND SPACE MODES OF TRANSPORTATION: PHASE III INTERIM REPORT. , 1999 .

[7]  Hanif D. Sherali,et al.  Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems , 1998, Oper. Res..

[8]  Arthur M. Geoffrion,et al.  An Improved Implicit Enumeration Approach for Integer Programming , 1969, Oper. Res..

[9]  A. M. Geoffrion Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .

[10]  Antonio A Trani,et al.  National Airspace Sector Occupancy and Conflict Analysis Models for Evaluating Scenarios under the Free-Flight Paradigm , 2000, Transp. Sci..

[11]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

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

[13]  Dimitris Bertsimas,et al.  The Traffic Flow Management Rerouting Problem in Air Traffic Control: A Dynamic Network Flow Approach , 2000, Transp. Sci..

[14]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[15]  S. Ratcliffe,et al.  Analysis of Long-Range Air Traffic Systems: Separation Standards—I , 1966, Journal of Navigation.

[16]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..

[17]  William Chan,et al.  FIELD TEST EVALUATION OF THE CTAS CONFLICT PREDICTION AND TRIAL PLANNING CAPABILITY , 1998 .

[18]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[19]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.