Research on the optimisation of flight landing scheduling with multi-runway
by Yunfang Peng; Qing Tang; Yajuan Han
International Journal of Computing Science and Mathematics (IJCSM), Vol. 9, No. 6, 2018

Abstract: Flight scheduling is the foundation and core of all the activities of airports and airlines. This paper analyses the problem of flight landing scheduling with multi-runway and establishes mathematical model. The aim is to determine the aircraft landing sequence and the landing time with the objective to minimise the landing time deviation cost. A new heuristic approach called cost decision algorithm (CDA) is present to solve the problem. This method selects the runway and decides the landing time by comparing the costs. With a series of experiments of different scale data, the mathematical model is solved by CDA and other algorithm. The computational results demonstrated the feasibility and superiority of the proposed algorithm by comparing with other algorithms in solutions and running time.

Online publication date: Mon, 26-Nov-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email