Abstract
This paper discourses the real time issues of aircraft scheduling. The concern of finding an ideal schedule aimed at aircraft landings is mentioned as the “aircraft landing problem” As every aircraft has a favored landing time, the aim is to diminish the aggregate delay costs meant for the whole aircraft landings while regarding the separation requirements. The chief goal is to diminish the overall cost along with improving aircraft scheduling performance. The proposed work has the subsequent stages, initially the aircrafts are divided as separate classes i.e., heavy, large along with small classes. For each and every aircraft classes, runway occupation profile, landing time and separation times are measured. Entropy value is calculated for the measured parameters. These entropy values are optimized by utilizing Cuckoo-search optimization algorithm. The optimized values are finally scheduled using FCFS algorithm. The employment of entropy based optimization and scheduling offers enhanced performance when paralleled with the prevailing efforts. The performance of proposed and existing results are contrasted and plotted.
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.
