Uma heurística de busca local para um problema parcialmente irrestrito de pouso de aeronaves: uma estudo de caso.

Abstract

The overload and insufficient supply of air traffic lead to imbalances in airport systems, resulting in increased operational costs, frequent flight delays, and passenger discomfort. These factors are recurring issues in the sector and create challenges in operational processes, thus directly affecting the efficiency and quality of services offered by airports and airlines. Therefore, this study aims to develop an optimization heuristic based on local search to solve the aircraft landing problem at an airport with a single runway. This approach aims to improve operational efficiency and air traffic management. The methodology used to achieve the research objective is classified as applied in nature, and in terms of approach, goals, and technical procedures, it is characterized as quantitative, exploratory, and case study, respectively. The study was carried out in six stages: data collection from a real database to build the instances used in the heuristic approach, a literature review, an understanding of the mathematical modeling of the aircraft landing problem, the construction of the heuristic method, the execution of computational results, and the statistical analysis of these results. The results showed that the proposed heuristic efficiently generates possible solutions with feasible computational execution times. Additionally, in experiments based on three instances using real data from Recife/Guararapes International Airport, the average total discrepancies ranged from 3875 UT to 3945 UT, with a standard deviation between 310.4 UT and 321 UT for the ten executions that the instances underwent. In summary, the proposed approach was determined to be a functional and practical tool for air traffic management.