Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 48, No. 4, July-August 2000, pp. 578-590
DOI: 10.1287/opre.48.4.578.12417
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Hoffman, R.
Right arrow Articles by Ball, M. O.
Right arrow Search for Related Content

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

Robert Hoffman, Michael O. Ball

Metron Scientific Consulting, 11911 Freedom Dr. Suite 800, Reston, Virginia 20190
R.H. Smith School of Business and Institute for Systems Research, University of Maryland, College Park, Maryland 20742

hoffman{at}metsci.com
mball{at}rhsmith.umd.edu

Both the single-airport ground-holding problem (GH) and the multi-airport ground-holding problem can be extended by the addition of banking constraints to accommodate the hubbing operations of major airlines. These constraints enforce the desire of airlines to land certain groups of flights, called banks, within fixed time windows, thus preventing the propagation of delays throughout their entire operation. GH can be formulated as a transportation problem and readily solved. But in the presence of banking constraints, GH becomes a difficult integer programming problem. In this paper, we construct five different models of the single-airport ground-holding problem with banking constraints (GHB). The models are evaluated both computationally and analytically. For two of the models, we show that the banking constraints induce facets of the convex hull of the set of integer solutions. In addition, we explore a linear transformation of variables and a branching technique.

Subject classifications: Programming: integer, algorithms; Transportation: models, air traffic management.
History: Received March 1997; revision received October 1997; accepted September 1998.




This article has been cited by other articles:


Home page
Transportation ScienceHome page
A. Mukherjee and M. Hansen
A Dynamic Stochastic Model for the Single Airport Ground Holding Problem
Transportation Science, November 1, 2007; 41(4): 444 - 456.
[Abstract] [PDF]


Home page
Transportation ScienceHome page
B. Kotnyek and O. Richetta
Equitable Models for the Stochastic Ground-Holding Problem Under Collaborative Decision Making
Transportation Science, May 1, 2006; 40(2): 133 - 146.
[Abstract] [PDF]


Home page
Transportation ScienceHome page
C. Barnhart, P. Belobaba, and A. R. Odoni
Applications of Operations Research in the Air Transport Industry
Transportation Science, November 1, 2003; 37(4): 368 - 391.
[Abstract] [PDF]


Home page
Operations ResearchHome page
M. O. Ball, R. Hoffman, A. R. Odoni, and R. Rifkin
A Stochastic Integer Program with Dual Network Structure and Its Application to the Ground-Holding Problem
Operations Research, January 1, 2003; 51(1): 167 - 171.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2000 by INFORMS.