scholarly journals The comparison of the metaheuristic algorithms performances on airport gate assignment problem

2017 ◽  
Vol 22 ◽  
pp. 469-478 ◽  
Author(s):  
Abdullah Aktel ◽  
Betul Yagmahan ◽  
Tuncay Özcan ◽  
M. Mutlu Yenisey ◽  
Engin Sansarcı
2014 ◽  
Vol 2014 ◽  
pp. 1-27 ◽  
Author(s):  
Abdelghani Bouras ◽  
Mageed A. Ghaleb ◽  
Umar S. Suryahatmaja ◽  
Ahmed M. Salem

The airport gate assignment problem (AGAP) is one of the most important problems operations managers face daily. Many researches have been done to solve this problem and tackle its complexity. The objective of the task is assigning each flight (aircraft) to an available gate while maximizing both conveniences to passengers and the operational efficiency of airport. This objective requires a solution that provides the ability to change and update the gate assignment data on a real time basis. In this paper, we survey the state of the art of these problems and the various methods to obtain the solution. Our survey covers both theoretical and real AGAP with the description of mathematical formulations and resolution methods such as exact algorithms, heuristic algorithms, and metaheuristic algorithms. We also provide a research trend that can inspire researchers about new problems in this area.


Aerospace ◽  
2021 ◽  
Vol 8 (6) ◽  
pp. 152
Author(s):  
Micha Zoutendijk ◽  
Mihaela Mitici

The problem of flight delay prediction is approached most often by predicting a delay class or value. However, the aviation industry can benefit greatly from probabilistic delay predictions on an individual flight basis, as these give insight into the uncertainty of the delay predictions. Therefore, in this study, two probabilistic forecasting algorithms, Mixture Density Networks and Random Forest regression, are applied to predict flight delays at a European airport. The algorithms estimate well the distribution of arrival and departure flight delays with a Mean Absolute Error of less than 15 min. To illustrate the utility of the estimated delay distributions, we integrate these probabilistic predictions into a probabilistic flight-to-gate assignment problem. The objective of this problem is to increase the robustness of flight-to-gate assignments. Considering probabilistic delay predictions, our proposed flight-to-gate assignment model reduces the number of conflicted aircraft by up to 74% when compared to a deterministic flight-to-gate assignment model. In general, the results illustrate the utility of considering probabilistic forecasting for robust airport operations’ optimization.


2015 ◽  
Vol 10 ◽  
pp. 920-930 ◽  
Author(s):  
Mario Marinelli ◽  
Gianvito Palmisano ◽  
Mauro Dell’Orco ◽  
Michele Ottomanelli

Sign in / Sign up

Export Citation Format

Share Document