Ground Delay Program Planning Under Uncertainty Based on the Ration-by-Distance Principle

Authors:
Michael O. Ball;Robert Hoffman;Avijit Mukherjee
Affiliations:
Robert H. Smith School of Business and Institute for Systems Research, University of Maryland, College Park, Maryland 20742;Metron Aviation, Inc., Dulles, Virginia 20166;University Affiliated Research Center, University of California (Santa Cruz), Moffett Field, California 94035
Venue:
Transportation Science
Year:
2010

Citing 7
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Strategic flow management for air traffic control

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

Operations Research
Slot Trading Opportunities in Collaborative Ground Delay Programs

Transportation Science
Equitable Models for the Stochastic Ground-Holding Problem Under Collaborative Decision Making

Transportation Science
A Dynamic Stochastic Model for the Single Airport Ground Holding Problem

Transportation Science
Matchings in connection with ground delay program planning

Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents ration-by-distance (RBD), a new allocation method to be used in planning ground delay programs (GDPs) for traffic flow management. It is shown that RBD minimizes total expected delay, under certain assumptions related to the manner in which GDPs are dynamically controlled. On the other hand, RBD taken to the extreme has poor characteristics with respect to the equity of the allocation it produces. To address this issue, we propose a constrained version of RBD as a practical alternative to allocation procedures used in operations today. It is shown that this algorithm has superior overall performance in terms of efficiency and equity relative to existing procedures.