Column Generation based solution for Bi-objective Gate Assignment Problems

Date

2024-04-29

Advisors

Journal Title

Journal ISSN

ISSN

Volume Title

Publisher

Springer

Type

Article

Peer reviewed

Yes

Abstract

In this paper, we present a column generation-based algorithm for the bi-objective gate assignment problem (GAP) to generate gate schedules that minimize squared slack time at the gates while satisfying passenger expectations by minimizing their walking distance. While most of the literature focuses on heuristic or metaheuristic solutions for the bi-objective GAP, we propose flow-based and column-based models that lead to exact or near optimal solution approaches. The developed algorithm calculates a set of solutions to approximate the Pareto front. The algorithm is applied to the over-constrained GAP where gates are a limited resource and it is not possible to serve every flight using a gate. Our test cases are based on real data from an international airport and include various instances with flight-to-gate ratios between 23.9 and 34.7. Numerical results reveal that a set of solutions representing a compromise between the passenger-oriented and robustness-oriented objectives may be obtained with a tight optimality gap and within reasonable computational time even for these difficult problems.

Description

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.

Keywords

Gate assignment problem, Multi-objective Optimization, Column Generation, epsilon-constraint method

Citation

Daş, G. S., and Gzara, F. (2024) Column generation based solution for bi-objective gate assignment problems. Mathematical Methods of Operations Research,

Rights

Attribution-NonCommercial-NoDerivatives 4.0 International
http://creativecommons.org/licenses/by-nc-nd/4.0/

Research Institute