An integer programming model for gate assignment problem at airline terminals

Chong Kok Chun, Syarifah Zyurina Nordin

Abstract


In this paper, we concentrate on a gate assignment problem (GAP) at the airlines terminal. Our problem is to assign an arrival plane to a suitable gate. There are two considerations needed to take. One of its is passenger walking distance from arrival gate to departure gate while another consideration is the transport baggage distance from one gate to another. Our objective is to minimize the total distance between the gates that related to assign the arrival plane to the suitable gates. An integer linear programming (ILP) model is proposed to solve this gate assignment problem. We also conduct a computational experiment using CPLEX 12.1 solver in AIMMS 3.10 software to analyze the performance of the model. Results of the computational experiments are presented. The efficiency of flights assignment is depends on the ratio of the weight for both total passenger traveling distances and total baggage transport distances.


Keywords


Gate Assignment Problem; Integer Linear Programming;

Full Text:

PDF

References


Bazargan, M. Airline Operations and Scheduling, USA: Ashgate Publishing Limited, 2010, pp. 171-182.

Pinedo, M. Scheduling Theory, Algorithms, and Systems, New York: Prentice Hall, 2008, pp. 2-3.

Ding, H.; Lim, A.; Rodrigues B.; Zhu, Y. Computers & Operations Research 32 (2004) 1867-1880.

Yan, S.Y.; Huo, C.-M. Transpotation Research 35(5) (1999) 413-432.

Gregory, D.; Phillip, J. L. Transportation Science 27(3) (1993) 281-297.

Michael, W. C.; Camille, C. P. Operations Research - A Practical Introduction, USA: CRC Press LLC, 2001, pp. 1-416.

Paul, E. F. Linear And Nonlinear Programming With Maple. USA: CRC Press, 2010, pp. 145-157.




DOI: https://doi.org/10.11113/mjfas.v11n2.349

Refbacks

  • There are currently no refbacks.


Copyright (c) 2015 Chong Kok Chun, Syarifah Zyurina Nordin

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.


Copyright © 2005-2019 Penerbit UTM Press, Universiti Teknologi Malaysia. Disclaimer: This website has been updated to the best of our knowledge to be accurate. However, Universiti Teknologi Malaysia shall not be liable for any loss or damage caused by the usage of any information obtained from this website.