Abstract—Scheduling aircraft landing is a complex task encountered by most of the control towers. In this paper, we study the aircraft landing problem (ALP) in the multiple runway case. We present in the first part, a mathematical formulation of the problem with a linear and nonlinear objective function. In the second part, we consider the static case of the problem where all data are known in advance and we present a new heuristic for scheduling aircraft landing on a single runway, this heuristic is incorporated into an ant colony algorithm to solve the multiple runway case.
Index Terms—Aircraft landing, Ant Colony Optimization, Mathematical programming, Scheduling.
Dr. G. Bencheikh is with the Department of Economics, Faculty of Law, Economic and Social Sciences, Meknes, Morocco (e-mail: email@example.com).
Prof. Dr. J. Boukachour is with the Department of Computer Sciences, Le Havre University Institute of Technology, Le Havre, France (e-mail: firstname.lastname@example.org)
Prof. A. EL Hilali Alaoui is with the Department of Mathematics, Faculty of Science and Technology, Fez, Morocco (e-mail: email@example.com).
Cite: Ghizlane Bencheikh, Jaouad Boukachour and Ahmed EL Hilali Alaoui, "Improved Ant Colony Algorithm to Solve the Aircraft Landing Problem," International Journal of Computer Theory and Engineering vol. 3, no. 2, pp. 224-233, 2011.