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

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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Operations research Ročník 48; číslo 4; s. 578 - 590
Hlavní autoři: Hoffman, Robert, Ball, Michael O
Médium: Journal Article
Jazyk:angličtina
Vydáno: Linthicum INFORMS 01.07.2000
Operations Research Society of America
Institute for Operations Research and the Management Sciences
Témata:
Air traffic
Air traffic control
Aircraft
Airports
Comparative analysis
Datasets
Flight time
Integer programming
Integers
Mathematical models
Musical intervals
Programming: integer, algorithms
Run time
Studies
Transportation: models, air traffic management
Vehicular flight
ISSN:0030-364X, 1526-5463
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.48.4.578.12417