A memetic algorithm to solve the dynamic multiple runway aircraft landing problem

Journal of King Saud University: Computer and Information Sciences

Ghizlane Bencheikh¹  Ahmed El Hilali Alaoui²  Jaouad Boukachour³ 

[1] Faculty of Law, Economics and Social Sciences, B.P. 3102, Toulal, Meknes, Morocco;Faculty of Science and Technology, B.P. 2202, Route d’Imouzzer, Fes, Morocco;University of Le Havre, 5 rue Boris Vian, 76610 Le Havre Cedex, France;

关键词: Dynamic aircraft landing problem;    Ant colony optimization;    Local search;    Metaheuristics;   

DOI  :  10.1016/j.jksuci.2015.09.002

来源: DOAJ

【 摘 要 】

The aircraft landing problem (ALP) consists of scheduling the landing of aircrafts onto the available runways in an airport by assigning to each aircraft a landing time and a specific runway while respecting different operational constraints. This is a complex task for the air traffic controller, especially when the flow of aircrafts entering the radar range is continuous and the number of aircrafts is unknown a priori. In this paper, we study the dynamic version of the ALP when new aircrafts appear over time, which means that the landing of the previous aircrafts should be rescheduled. To solve this problem, we propose a memetic algorithm combining an ant colony algorithm and a local heuristic.

【 授权许可】

Unknown