Airport Gate Assignment as a Nash Equilibrium Problem
- 1 July 2022
- journal article
- research article
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Air Transportation
- Vol. 30 (3), 81-90
- https://doi.org/10.2514/1.d0281
Abstract
The airport gate assignment problem addresses the optimal assignment of a set of aircraft to a set of stands. The underlying combinatorial optimization problem is usually modeled as a binary quadratic assignment problem, whereby the stand assignment of a certain aircraft depends on the stand assignment of all other aircraft. The solving time of the optimization problem may increase exponentially with the number of aircraft and stands considered. For this reason, real-case scenarios can be solved only by heuristics in due time. In this paper, we propose a novel approach on modeling and solving the airport gate assignment problem by making use of the game theory. The aim is to identify a Nash equilibrium as a solution of the airport gate assignment problem in the following sense: no aircraft can improve its stand assignment by a sole deviation from its assigned stand. The algorithm is capable of delivering an assignment for a real-case scenario in minutes instead of hours. The performance of the algorithm is demonstrated by modeling and solving a real-case scenario for terminal 2 of the Munich Airport.Keywords
This publication has 6 references indexed in Scilit:
- Exact and heuristic approaches to the airport stand allocation problemEuropean Journal of Operational Research, 2015
- A railway maintenance scheduling problem with customer costsEURO Journal on Transportation and Logistics, 2015
- The Airport Gate Assignment Problem: A SurveyThe Scientific World Journal, 2014
- Decomposition algorithms for generalized potential gamesComputational Optimization and Applications, 2010
- Generalized Nash Equilibrium ProblemsAnnals of Operations Research, 2009
- Multicriteria airport gate assignment and Pareto simulated annealingIIE Transactions, 2008