Abstract

 
 
 
 In this paper, we study the aircraft landing problem (ALP), which considered as one of a combinatorial optimization problems, in a single runway case. We present in the first part, a mathematical formulation of the problem with a linear objective function. In the second part, we consider the static case of the problem where all data are known in advance. We present a new heuristic for scheduling static case of aircraft landing; this heuristic is incorporated into Bees algorithm to solve this problem.
 
 
 
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 callDisclaimer: 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.
