Optimizing Gate Assignments at Airport Terminals

Chen

2016

Int. J. Autom. Comput.

Abstract:This paper reviews existing approaches to the airport gate assignment problem (AGAP) and presents an optimization model for the problem considering operational safety constraints. The main objective is to minimize the dispersion of gate idle time periods (to get robust optimization) while ensuring appropriate matching between the size of each aircraft and its assigned gate type and avoiding the potential hazard caused by gate apron operational conflict. Genetic algorithm is adopted to solve the problem. An illustrative example is given to show the effectiveness and efficiency of the algorithm. The algorithm performance is further demonstrated using data of a terminal from PEK airport.

Section: Literature Reviewmentioning

confidence: 99%

Robust assignment of airport gates with operational safety constraints

Chen

2016

Int. J. Autom. Comput.

“…In [36] an integer program with an extended objective function that takes into account transfer of passengers is proposed.…”

Section: Types Of Objectivesmentioning

confidence: 99%

“…The objective is to reduce the number of passengers who have to walk maximum distances -at the price that more passengers have to walk the minimum distances, compared to random aircraft position assignment. Contrary to [1] Mangoubi and Mathaisel [36] take into account transfer passengers. Moreover, they use the LP relaxation and greedy heuristics to solve the GAP.…”

Section: State-of-the-art Algorithmmentioning

confidence: 99%

Flight gate scheduling: State-of-the-art and recent developments

Dorndorf

Drexl

Nikulin

et al. 2007

Omega

129

Standard-Nutzungsbedingungen:Die Dokumente auf EconStor dürfen zu eigenen wissenschaftlichen Zwecken und zum Privatgebrauch gespeichert und kopiert werden.Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle Zwecke vervielfältigen, öffentlich ausstellen, öffentlich zugänglich machen, vertreiben oder anderweitig nutzen.Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, gelten abweichend von diesen Nutzungsbedingungen die in der dort genannten Lizenz gewährten Nutzungsrechte. This work has been supported by the German Science Foundation (DFG) through the grant "Planung der Bodenabfertigung an Flughäfen" (Dr 170/9-1, 9-2 and Pe 514/10-2). Terms of use: Documents in2 Corresponding author Abstract This paper surveys a large variety of mathematical models and up-to-date Solution techniques developed for solving a general flight gate scheduling problem that deals with assigning difFerent aircraft activities (arrival, departure and intermediate parking) to distinct aircraft stands or gates. The aim of the work is both to present various models and Solution techniques which are available in nowadays literature and to give a general idea about new open problems that arise in practise. We restrict the scope of the paper to flight gate Management without touching scheduling of ground handling Operations.Keywords: flight gate scheduling, assignment of aircraft activities to terminals, survey of models and algorithms.

Transportation Research Part A: Policy and Practice

“…Their formulation considered only originating and terminating passengers, however, and did not take the walking distances of transfer passengers into account. Mangoubi and Mathaisel [1985] incorporated transfer passengers into their formulation of the flight-to-gate assignment problem. Their integer programming formulation to minimize the total distance, Z, walked by all passengers is expressed as:…”

Section: -Passenger Walking Distancesmentioning

confidence: 99%

Planning level decision support for the selection of robust configurations of airport passenger buildings

1997

Prevalent in the current practice of airport design is the view of the airport as a "terminal", or beginning and ending point only of a traveler's journey. Such a perspective wrongly encourages the belief that airport performance can be measured with only a limited number of criteria over a narrow range of conditions. This dissertation adopts the view that performance should be considered in broad range, multiple criteria terms, in order to balance the (often conflicting) objectives of the different users of an airport's services.To accomplish this goal, we develop a series of prototype Passenger Building Configuration Evaluator (PBCE) tools, to help airport planners during the selection of an initial configuration concept. To study objectively the differences among dissimilar concepts, we identify a general airport configuration nomenclature and use it to represent several different concepts geometrically. From these characterizations, we obtain the absolute distances between any two points within the airport. Based on assumptions regarding the distribution of passengers, we then estimate the transition probabilities of traveling between any of these points. Using the PBCE tools and well-known results of geometrical probability, we show how we can estimate the potential performance of any given configuration and geometry.Using a representation of data called a "performance profile", we demonstrate how planners can select an initial configuration based on robustness, or performance over a broad range. Specifically, we illustrate the selection process faced with uncertainty in such parameters as the level and type of transfer traffic, industry structure, and size. Our analyses suggest that configurations most appropriate for minimizing expected walking distances may not be the most appropriate for minimizing the expected taxi distances (and required number of turns) for aircraft.We also address the issue of passenger congestion, both in pedestrian walkways and waiting areas. Included in our analysis is a discussion of the IATA level of service standards, and a survey of how current practitioners use these standards during the planning process. Finally, we show how simple, "back-of-the-envelope" type calculations can be used to obtain congestion estimates consistent with ones obtained from more detailed, data intensive methods.