Authors: Yunfang Peng; Qing Tang; Yajuan Han
Addresses: School of Management, Shanghai University, Shanghai, China ' School of Management, Shanghai University, Shanghai, China ' School of Management, Shanghai University, Shanghai, China
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.
Keywords: flight landing scheduling; multi-runway mathematical model; cost decision algorithm; CDA.
International Journal of Computing Science and Mathematics, 2018 Vol.9 No.6, pp.602 - 611
Received: 28 Feb 2018
Accepted: 21 Mar 2018
Published online: 26 Nov 2018 *