Stochastic optimization models for the airport gate assignment problem

Şeker, Merve and Noyan, Nilay (2012) Stochastic optimization models for the airport gate assignment problem. Transportation Research Part E: Logistics and Transportation Review, 48 (2). pp. 438-459. ISSN 1366-5545

This is the latest version of this item.

[img]PDF - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1016/j.tre.2011.10.008


Uncertainties inherent in the airport traffic may lead to the unavailability of gates for accommodating scheduled flights. Incorporating random disruptions is crucial in constructing effective flight-gate assignments. We consider the gate assignment problem under uncertainty in flight arrival and departure times and develop stochastic programming models incorporating robustness measures based on the number of conflicting flights, idle and buffer times. The proposed models are formulated as large-scale mixed-integer programming problems and tabu search algorithms are implemented to obtain assignments of reasonable quality. We conduct a computational study to analyze the proposed alternate models and show the effectiveness of the solution methods.

Item Type:Article
Uncontrolled Keywords:Gate assignment; Random disruptions; Stochastic arrival times; Robustness; Stochastic programming; Tabu search
Subjects:Q Science > Q Science (General)
T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering > T57.6-57.97 Operations research. Systems analysis
ID Code:17265
Deposited By:Nilay Noyan
Deposited On:22 Nov 2011 14:37
Last Modified:30 Jul 2019 13:58

Available Versions of this Item

Repository Staff Only: item control page