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

Hanif D. Sherali (), J. Cole Smith () and Antonio A. Trani ()
Additional contact information
Hanif D. Sherali: Grado Department of Industrial and Systems Engineering (0118), Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061
J. Cole Smith: Department of Systems and Industrial Engineering, University of Arizona, Tucson, Arizona 85721
Antonio A. Trani: Charles Edward Via, Jr. Department of Civil and Environmental Engineering (0105), Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061

Transportation Science, 2002, vol. 36, issue 4, 378-397

Abstract: 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.

Date: 2002
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.36.4.378.546 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:36:y:2002:i:4:p:378-397

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().