A Hybrid Metaheuristic for Multiple Runways Aircraft Landing Problem Based on Bat Algorithm | Zendy

Jian Xie | Zendy; Yongquan Zhou | Zendy; Hongqing Zheng | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Hybrid Metaheuristic for Multiple Runways Aircraft Landing Problem Based on Bat Algorithm

Author(s) -

Jian Xie,

Yongquan Zhou,

Hongqing Zheng

Publication year - 2013

Publication title -

journal of applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.307

H-Index - 43

eISSN - 1687-0042

pISSN - 1110-757X

DOI - 10.1155/2013/742653

Subject(s) - runway , initialization , computer science , metaheuristic , mathematical optimization , convergence (economics) , scheduling (production processes) , algorithm , mathematics , archaeology , economics , history , programming language , economic growth

The aircraft landing problem (ALP) is an NP-hard problem; the aim of ALP is to minimize the total cost of landing deviation from predefined target time under the condition of safe landing. In this paper, the multiple runways case of the static ALP is considered and a hybrid metaheuristic based on bat algorithm is presented to solve it. Moreover, four types of landing time assignment strategies are applied to allocate the scheduling time, and a constructed initialization is used to speed up the convergence rate. The computational results show that the proposed algorithm can obtain the high-quality and comparable solutions for instances up to 500 aircrafts, and also it is capable of finding the optimal solutions for many instances in a short time

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research