Iterated Local Search Algorithm For Planning The Sequence Of Arrivals And Departures At Airport Runways

In this paper, in order to tackle one of the dozens of the challenging optimization problems in aviation industry, we introduce an algorithm for planning the sequence of arrivals and departures of aircraft in a runway. The algorithm is based in Iterated Local Search (ILS) algorithm and uses two effective operators, namely swap and shift, for exploring the neighborhood of current running solution. The experiments that are conducted with real instances show that this approach achieves better results than the First Come First Served approach, while computing the results in relatively short period of time, which is in order of milliseconds.