An integer programming approach to support the US Air Force's air mobility network

Authors:
Corbin G. Koepke;Andrew P. Armacost;Cynthia Barnhart;Stephan E. Kolitz
Affiliations:
Air Force Research Laboratory, USA;United States Air Force Academy, Department of Management, 2354 Fairchild Drive, Rm. 6H128, USAF Academy, CO 80840, USA;Massachusetts Institute of Technology, Center for Transportation and Logistics, 77 Massachusetts Avenue, Bldg. E40-149, Cambridge, MA 02139, USA;The Charles Stark Draper Laboratory, Inc., 555 Technology Square, Cambridge, MA 02139, USA
Venue:
Computers and Operations Research
Year:
2008

Citing 11
Cited 0

A Stochastic Integer Program with Dual Network Structure and Its Application to the Ground-Holding Problem

Operations Research
The Air Traffic Flow Management Problem with Enroute Capacities

Operations Research
Multiairport Ground Holding Problem: a Computational Evaluation of Exact Algorithms

Operations Research
A Comparison of Formulations for the Single-Airport Ground-Holding Problem with Banking Constraints

Operations Research
From Ground Holding to Free Flight: An Exact Approach

Transportation Science
Optimizing Military Airlift

Operations Research
Composite Variable Formulations for Express Shipment Service Network Design

Transportation Science
Network design formulations for scheduling U.S. Air Force channel route missions

Mathematical and Computer Modelling: An International Journal
Solving the theater distribution vehicle routing and scheduling problem using group theoretic tabu search

Mathematical and Computer Modelling: An International Journal
Solving the aerial fleet refueling problem using group theoretic tabu search

Mathematical and Computer Modelling: An International Journal
A review of strategic mobility models supporting the defense transportation system

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

The United States Air Force's air mobility command is responsible for creating a schedule and executing that schedule for a large-scale air mobility network that encompasses aircraft with prioritized missions. Aerial ports (airports) can process or park a maximum number of aircraft, called the maximum on ground (MOG). As the schedule changes due to disruptions, such as equipment failure or weather, the MOG constraint can cause the new schedule to be infeasible. Traditionally, re-planning the channel route schedule to adhere to MOG constraints has been a manual process that usually stops after the first feasible set of changes is found, due to the challenges of large amounts of data and urgency for a re-plan. We extend Bertsimas and Stock's integer program formulation for the commercial airline Multi-Airport Ground-Holding Problem to the air mobility network. Our integer programming formulation recommends delays to certain aircraft on the ground to minimize the effects of system-wide disruptions while taking account mission priorities of the aircraft.