Bilevel programming model and algorithms for flight gate assignment problem

6Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Considering the decision-making requirements of airport, airlines and passengers, a bilevel programming model which contains two parts was proposed in this paper. One part is to improve the utilization of gates of the airport (upper level), so the objective function of the upper level to the minimum overall variance of slack time between two consecutive air crafts at the same gate. The other part looks at maximize the airline revenue and passengers more conveniently and comfortably (lower level). The lower level has two objective functions-the minimum passenger transfer failure and the minimum passenger average transfer time, respectively. According to the latest data of an airport in Eastern China, the adaptive genetic algorithm is used to solve the above-mentioned bilevel optimisation problems. The numerical experiment shows that the model not only reduces the variance of the relaxation time, but also optimises the flight gate allocation and achieves the initial goal.

Cite

CITATION STYLE

APA

Lin, J., Ding, X., Li, H., & Zhou, J. (2020). Bilevel programming model and algorithms for flight gate assignment problem. Aeronautical Journal, 124(1281), 1667–1682. https://doi.org/10.1017/aer.2020.40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free