CBL - Campus del Baix Llobregat

Projecte llegit

Títol: Solving the allocation problem of the airport parking stands

Estudiants que han llegit aquest projecte:

Director/a: PONS PRATS, JORDI

Departament: FIS

Títol: Solving the allocation problem of the airport parking stands

Data inici oferta: 11-01-2024     Data finalització oferta: 11-09-2024


Estudis d'assignació del projecte:
    GR ENG SIST AEROESP
Tipus: Individual
 
Lloc de realització: EETAC
 
Paraules clau:
Allocation, optimisation, linear programming algorithm, genetic algorithm
 
Descripció del contingut i pla d'activitats:
Development of a software solution that enables to optimise the allocation of the parking stands of an airport. Based on an optimisation heuristic (either Linear programming or Genetic Algorithms could be selected, among other options to be analysed), the software will consider a set of restrictions to determine which is the best allocation possible. Restrictions like lead time, size of the plane and the stand, airline preferences, distance to the runway and other will be analysed and proposed for implementation.
An analysis of the airport configuration, operations and aircraft performance will be done in order to identify the most suitable set of parameters to be used.
The application to a known airport, like Barcelona, is also foreseen.

Working plan:
- State of the art analysis; allocation problems, optimisation techniques, airport operations, '
- Definition of the problem; parameters to be used, methods and techniques
- Development phase; implementation of the software
- Test phase
- Development of the applications; Barcelona airport (TBC)

 
Overview (resum en anglès):
The stand allocation problem is a main problem in all airports and has to be solved every day without exception. The rapid increase in the air traffic and its continued growth during the last years has made this problem a major issue in all airports. This is mainly caused because in most of the cases the airports are not growing as fast as the air traffic. In addition, in the past years, airlines had tried to reduce the time that aircraft are on ground in order to maximize their benefits causing the stand allocation to become a major concern. This has produced the necessity of having a system capable of solving this problem taking into account different constraints and preferences that can vary on each airport or between the different airlines.

In this project, two algorithms are designed and compared. The purpose is to see if it's possible to create a software capable of solving a stand allocation problem using one of this two algorithms. The algorithms that are used are a mixed-integer linear programming algorithm and a genetic algorithm. The development of the linear programming algorithm has been more or less straightforward due to the simplicity of the used library. In contrast, the implementation of the genetic algorithm has not been that easy because some changes on the basic functions of the algorithm had to be made. In order to do all these changes some easy problems were designed and tested increasing the complexity gradually in order to find the strong and weak points of the algorithm.

After designing the algorithms and improving them, the algorithms were tested with different invented and real airport cases. The genetic algorithm was able to find solutions for all the cases. In contrast, the linear programming algorithm stuck in problems involving big amounts of data. It can be said that the initial objective has been accomplished for the genetic algorithm and, less successfully, for the linear programming algorithm.

© CBLTIC Campus del Baix Llobregat - UPC