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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer Theory and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
