Your browser does not support JavaScript!

Metaheuristic algorithms for the simultaneous slot allocation problem

Metaheuristic algorithms for the simultaneous slot allocation problem

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Intelligent Transport Systems — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In this study, the authors propose the formalisation 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. The authors 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. They compare these algorithms on randomly generated instances and 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 because of memory and computation time requirements. Metaheuristics, instead, can deal with large instances, allocating slots to more than 99.8% of flights.

Related content

This is a required field
Please enter a valid email address