Solving Dynamic Single-Runway Aircraft Landing Problems With Extremal Optimisation

Abstract

A dynamic implementation of the single-runway aircraft landing problem was chosen for experiments designed to investigate the adaptive capabilities of extremal optimisation. As part of the problem space is unimodal, we developed a deterministic algorithm which optimises the time lines of the permutations found by the EO solver. To assess our results, we experimented on known problem instances for which benchmark solutions exist. The nature and difficulty of the instances used were assessed to discuss the quality of results obtained by the solver. Compared to the benchmark results available, our approach was highly competitive