Robustness Algorithms for the Airport Gate Assignment Problem

Authors

  • Amadeo Asco Signes

Keywords:

robustness, airport gate assignment problem, scheduling, heuristics, evolutionary algorithms

Abstract

Assigning commercial flights to available airport gates can have a major impact on the efficiency of flight schedules as well as on the level of passenger satisfaction with the service. These assignments also depend on the service requirements of flights and the capacity of stand facilities. Unexpected changes also called perturbations, like those due to air traffic delays, severe weather conditions, or equipment failures, may disrupt the initial assignments and increase the difficulty of maintaining smooth operations, which will detrimentally affect costumer satisfaction. The provision of solutions which reduce the potential detrimental effect of perturbations in the stands already assigned on the day of operation is desirable and some approaches are presented here, and compare between them to help identify their performance and trends.

How to Cite

Amadeo Asco Signes. (2020). Robustness Algorithms for the Airport Gate Assignment Problem. Global Journal of Computer Science and Technology, 20(C1), 37–52. Retrieved from https://computerresearch.org/index.php/computer/article/view/1932

Robustness Algorithms for the Airport Gate Assignment Problem

Published

2020-01-15