Full text
| |
| Author(s): |
Lorrany Cristina da Silva
Total Authors: 1
|
| Document type: | Doctoral Thesis |
| Press: | São Carlos. |
| Institution: | Universidade de São Paulo (USP). Instituto de Ciências Matemáticas e de Computação (ICMC/SB) |
| Defense date: | 2022-10-04 |
| Examining board members: |
André Carlos Ponce de Leon Ferreira de Carvalho;
Maria do Socorro Nogueira Rangel;
Mariá Cristina Vasconcelos Nascimento Rosset;
Eli Angela Vitor Toso
|
| Advisor: | André Carlos Ponce de Leon Ferreira de Carvalho; Maristela Oliveira dos Santos |
| Abstract | |
Air traffic management has become increasingly complex due to the increasing use of air transport. One of the main management bottlenecks is planning the efficient use of runways for takeoff and landing. This thesis aims to investigate the Aircraft Landing Problem, which seeks to minimize earliness and tardiness in aircraft landing time, assigning it to a runway to land and sequencing them. The first contribution of the thesis is in the comparison of four mathematical formulations from the literature, three directly comparable and another containing a particularity that does not allow a direct comparison with the other formulations. In addition to comparing and identifying which of the formulations presents the best computational performance to solve the problem instances, we also analyze the quality of the solution of the last formulation when considering a new set of constraints. The optimization package Gurobi Optimizer was used for the computational tests. The second contribution of the thesis lies in the new mathematical formulation proposed for the problem, together with a matheuristic to solve instances with a greater number of aircraft that Gurobi Optimizer cannot solve optimally. Matheuristic first finds an initial solution using relax-and-fix (RF) and then fix-and-optimize (FO) improves the solution found. In order to define good values of parameters for the RF, we perform the calibration of these through extensive tests to obtain a quality solution in a viable runtime. Comparisons were also made using the first solution obtained by Gurobi Optimizer and later improving it with FO. Computational tests were performed on 49 instances of the literature and in 17 instances generated from real data from the GRU Airport. The proposed formulation was compared with other mathematical formulations in the literature, proving to be competitive. Among the variations of matheuristics, the one that obtained the best results was the combination of RF with FO and the RF also showed efficiency compared to the work in the literature that uses matheuristics. (AU) | |
| FAPESP's process: | 17/21488-2 - Runway use optimization in the Air Traffic Flow Management |
| Grantee: | Lorrany Cristina da Silva |
| Support Opportunities: | Scholarships in Brazil - Doctorate |