doi: 10.7763/IJCTE.2011.V3.309
Improved Ant Colony Algorithm to Solve the Aircraft Landing Problem
Ghizlane Bencheikh1
,
Jaouad Boukachour2 ,
Ahmed EL Hilali Alaoui3
- 1Department of Economics, Faculty of Law, Economic and Social Sciences, Meknes, Morocco.
- 2Department of Computer Sciences, Le Havre University Institute of Technology, Le Havre, France
- 3Department of Mathematics, Faculty of Science and Technology, Fez, Morocco.
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.
Keywords
- Aircraft landing
- Ant Colony Optimization
- Mathematical programming
- Scheduling
How to 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. https://doi.org/10.7763/IJCTE.2011.V3.309
Copyright & License
Copyright © 2011 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).