Metaheuristic algorithms for the simultaneous slot allocation problem | Zendy

Paola Pellegrini | Zendy; Lorenzo Castelli | Zendy; Raffaele Pesenti | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Metaheuristic algorithms for the simultaneous slot allocation problem

Author(s) -

Paola Pellegrini,

Lorenzo Castelli,

Raffaele Pesenti

Publication year - 2012

Publication title -

iet intelligent transport systems

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.579

H-Index - 45

eISSN - 1751-9578

pISSN - 1751-956X

DOI - 10.1049/iet-its.2011.0179

Subject(s) - metaheuristic , iterated local search , mathematical optimization , integer programming , computer science , iterated function , integer (computer science) , linear programming , computation , algorithm , mathematics , mathematical analysis , programming language

In this paper, we propose the formalization of the simultaneous slot allocation problem (SSAP), that extends in two directions the current way of allocating airport slots in Europe. The SSAP requires, first, to perform the slot allocation at all airports simultaneously and, second, to respect airspace sector capacities. We solve the SSAP with two algorithms based on metaheuristics, namely Iterated Local Search and Variable Neighborhood Search, and with an algorithm based on an integer linear programming model. We compare these algorithms on randomly generated instances and we show that for small instances metaheuristics are competitive with the integer linear programming model. Nevertheless, the integer linear programming model is unable to solve medium or large instances due to memory and computation time requirements. Metaheuristics, instead, can deal with large instances, allocating slots to more than 99.8% of flights

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research