Robustness Algorithms for the Airport Gate Assignment Problem
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.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2020-01-15
Issue
Section
License
Copyright (c) 2020 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.