Abstract
An airport gate is the core resource of an airport operation, which is an important place for passengers to get on and off the aircraft and for maintaining aircraft. It is the prerequisite for other related dispatch. Effective and reasonable allocation of gates can reduce airport operating costs and increase passenger satisfaction. Therefore, an airport gate assignment problem (AGAP) needs to be urgently solved in the actual operation of the airport. In this paper, considering the actual operation of the airport, we formulate an integer programming model for AGAP by considering multiple constraints. The model aims to maximize the number of passengers on flights parked at the gate. A tabu search-based algorithm is designed to solve the problem. In the process of algorithm design, an effective initial solution is obtained. A unique neighborhood structure and search strategy for tabu search are designed. The algorithm can adapt to the dynamic scheduling of airports. Finally, tests are performed using actual airport data selected from Kunming Changshui International Airport in China. The experimental results indicate that the proposed method can enhance the local search ability and global search ability and get satisfactory results in a limited time. These results provide an effective support for the actual gate assignment in airport operations.
Document type: Article
Full document
Original document
The different versions of the original document can be found in:
- http://dx.doi.org/10.1155/2020/8835201 under the license https://creativecommons.org/licenses/by/4.0/
under the license https://creativecommons.org/licenses/by/4.0/
Document information
Published on 01/01/2020
Volume 2020, 2020
DOI: 10.1155/2020/8835201
Licence: Other
Share this document
Keywords
claim authorship
Are you one of the authors of this document?