Mathematical Model of Optimal Assignment of Aircraft to Apron Gates with Safety Constraint Considerations

Document Type : Original Research

Authors
M. Farajollahi 1
A. Abdi Kordani 2
A. Sarkar 1
M. Shadman 2
1 Faculty of Civil Engineering, Islamic Azad University, Science and Research Branch, Tehran, Iran
2 Faculty of Technical and Engineering, Imam Khomeini International University, Qazvin, Iran
0.22034/23.4.7
Abstract
Airports are one of the most vital infrastructures of any country, which play an important role in transporting cargo and passengers to different parts of the world. The preservation and optimal use of airport resources and assets is one of the main goals of airport managers. On the other hand, airlines have a special concern on saving time, fuel consumption, maintaining passenger satisfaction, and so on. One of the most important resources in the world's major airports are the gates of the passenger terminals of airports, which have an undeniable aspect in the better performance of the airport. The assigning of aircraft to these gates has long been a concern for researchers in operations research as well as air transport activists. This research deals with the issue of assigning aircraft to the passenger terminal gate. The problem of optimal gate assignment is a complex issue and requires consideration of many parameters and variables in order to achieve the desired result. In this research, it’s tried to solve the gate allocation problem by presenting a suitable model. Providing an appropriate linear model is one of the main challenges of the problem. A special attention has been paid to the issue of safety. Therefore, by applying safety restrictions, a suitable model is provided. The main purpose of this study is to minimize the scatter of idle (lost) gates while not preventing mismatch between flight size and gate and also justifying safety needs. These cases are assigned and examined in the framework of the optimization model in this research. To solve such problems, which are usually not possible by manual calculations or are very time consuming, the metaheuristic algorithms are used. Since because NP-Hard nature of problem, it is very time consuming and difficult in the usual way. Therefore, this study tries to provide an efficient and fast way to solve the gate assignment problem. In the proposed method, first all the sentences of the objective function were considered as, then all were divided into two categories of hard and soft constraints. On the other hand, in the model of the basic method, the power of two terms in the objective function is used. The proposed model was modified. In the end, it was tried to modify the terms of the objective function and constraints in such a way that in addition to meeting the expectations and constraints of the problem, it allows the use of two flights from the same gate (MARS effect) to increase resource efficiency. The method is based on a genetic algorithm that includes the initial population, selection, combination or mutation, generation of a new offspring, and re-selection. In this study, 5 scenarios with various flights and gates have been used. The improvement of total idle times in the first scenario was 72.75%, in the second scenario 76.92%, in the third scenario 82.38%, in the fourth scenario 82.38% and in the fifth scenario 79.67%. All of results. Show the efficiency of proposed model.

Keywords

Subjects

[1] Cheng Y. 1998 Solving push-out conflicts in apron taxiways of airports by a network-based simulation. Computers & Industrial Engineering, 34(2), 351–369.
[2] Babić O., Teodorović D., and Tošić V., 1984 “Aircraft Stand Assignment to Minimize Walking.” Journal of Transportation Engineering, 110 (1), 55–66.
[3] Mangoubi R., Mathaisel F. 1985 OPTIMIZING GATE ASSIGNMENTS AT AIRPORT TERMINALS. Transportation Science, 19(2), 173–188.
[4] Bihr R. 1990 A Conceptual Solution to the Aircraft Gate Assignment Problem Using 0,1 Linear Programming. Computers and Industrial Engineering 19, 280-284.
[5] Haghani A., Chen M. 1998 Optimizing Gate Assignments at Airport Terminals. Transportation Research Part A: Policy and Practice, 32 (6), 437–454.
[6] Jiefeng X., Bailey G. 2001 The Airport Gate Assignment Problem: Mathematical Model and a Tabu Search Algorithm. Proceedings of the Hawaii International Conference on System Sciences, 77.
[7] Maharjan B., Matis T. 2011 An Optimization Model for Gate Reassignment in Response to Flight Delays. Journal of Air Transport Management, 17(4), 256-261.

[8] Atkin J. A. D., Burke E. K., Ravizza S. 2011 A more realistic approach for airport ground movement optimisation with stand holding. In Proceedings of the 5th Multidisciplinary International Conference on Scheduling: Theory and Applications, Phoenix, USA.
[9] Kim S. H., Feron E. 2012 Impact of gate assignment on gate holding departure control strategies. In Proceedings of the IEEE/AIAA 31st Digital Avionics Systems Conference, IEEE, Williamsburg, USA, 4E3-1–4E3-8.
[10] Narciso E., Piera M. 2015 Robust Gate Assignment Procedures from an Airport Management Perspective, Omega, 50, 82-95.
[11] Liu S., Chen W., Liu J. 2016 Robust assignment of airport gates with operational safety constraints. International Journal of Automation and Computing, 13(1), 31-41.
[12] Pternea M., and Haghani Ali., 2018 Mathematical Models for Flight-to-Gate Reassignment with Passenger Flows: State-of-the-Art Comparative Analysis, Formulation Improvement, and a New Multidimensional Assignment Model, Computers and Industrial Engineering, 123, 103–118.
[13] Safari H., Faghih A., 2015 Solve project scheduling problems with resource constraints using a modified Imperialist Competitive Algorithm, Industrial Management Journal, 7(2), 333-364 (In Persian).
Modares Civil Engineering journal
Volume 23, Issue 4
September and October 2023
Pages 7-17