A heuristic algorithm for the Aircraft Landing Problem
Amir Salehipour · MODSIM · 2017
The Aircraft Landing Problem is the problem of allocating an airport's runways (processing units) to arriving aircraft (competing tasks) as well as scheduling the landing time of aircraft, with the objective of minimizing total deviations from the target landing times.This work proposes a new approach to solve the Aircraft Landing Problem that includes separating sequencing and scheduling aircraft.While obtaining the optimal sequence of landing is very difficult, particularly for large instances, an optimal schedule for a given sequence can be delivered in polynomial time.We apply the construction algorithm of Salehipour et al. (2013) to construct an initial sequence of landing, and then we improve this sequence by developing a relaxation heuristic, which relaxes and re-optimizes the sequence.Computational experiments over a set of standard instances demonstrate the performance of the proposed approach.