Final published version
Research output: Working paper
Research output: Working paper
}
TY - UNPB
T1 - A Multiobjective Genetic Algorithm for Airport Slot Allocation Decision Making
AU - Katsigiannis, Fotis
AU - Zografos, Konstantinos G.
PY - 2024/4/11
Y1 - 2024/4/11
N2 - The demand-supply imbalance at highly congested (level 3) airports is predominantly managed through the World Airport Scheduling (WASG) guidelines. To provide efficient solutions at congested airports, current research has proposed multi-objective, Mixed Integer Programming (MIP) models, which often result in complex large-scale formulations that cannot be solved in practical computational times, hence requiring the proposition of heuristic algorithms. This paper presents a multi-objective solution framework for supporting the allocation of slots at large coordinated airports. The algorithm allocates requests of higher priority by solving hierarchically a series of MIP models. As the capacity of the airport under consideration becomes saturated, requests of lower priority are divided into subgroups based on an unsupervised learning technique that considers each request’s airport capacity utilisation. A genetic algorithm determines the allocation sequence of the generated subgroups and constructs multiple schedules. Our tests suggest that the algorithm exploits the synergies between Operations Research (OR) and Machine Learning (ML) methodologies and can cope effectively with large airport instances and generate multiple schedules.
AB - The demand-supply imbalance at highly congested (level 3) airports is predominantly managed through the World Airport Scheduling (WASG) guidelines. To provide efficient solutions at congested airports, current research has proposed multi-objective, Mixed Integer Programming (MIP) models, which often result in complex large-scale formulations that cannot be solved in practical computational times, hence requiring the proposition of heuristic algorithms. This paper presents a multi-objective solution framework for supporting the allocation of slots at large coordinated airports. The algorithm allocates requests of higher priority by solving hierarchically a series of MIP models. As the capacity of the airport under consideration becomes saturated, requests of lower priority are divided into subgroups based on an unsupervised learning technique that considers each request’s airport capacity utilisation. A genetic algorithm determines the allocation sequence of the generated subgroups and constructs multiple schedules. Our tests suggest that the algorithm exploits the synergies between Operations Research (OR) and Machine Learning (ML) methodologies and can cope effectively with large airport instances and generate multiple schedules.
M3 - Working paper
BT - A Multiobjective Genetic Algorithm for Airport Slot Allocation Decision Making
PB - SSRN Working Paper
ER -