Please use this identifier to cite or link to this item:
Title: A modified variable neighborhood search for aircraft landing problem
Authors: Ng, KKH
Lee, CKM
Keywords: Aircraft landing problem
Airside operation
Variable neighborhood search
Issue Date: 2016
Publisher: Institute of Electrical and Electronics Engineers Inc.
Source: 2016 IEEE International Conference on Management of Innovation and Technology, ICMIT 2016, 2016, 7605020, p. 127-132 How to cite?
Abstract: Aircraft landing problem is a crucial operation in air traffic flow management. Appropriate and efficient landing sequencing, runway assignment and scheduled landing time are of great importance to maintain flight safety and minimize the overall tardiness of all flights. The heuristic approaches mainly focus on providing a fast and feasible solution in a reasonable amount of time. The proposed modified variable neighbor search heuristic shows its robustness in searching the optimal result. The computational study for analyzing the algorithm indicates the effectiveness in handling time sensitive aircraft landing model. The performance of the proposed algorithm is analyzed in comparison with the result from the literature and it is capable of accommodating the perturbation strengthen iteratively to escape from the local optimum trap and reduce the computational burden in branch-and-bound algorithm using CPLEX optimizer.
Description: 2016 IEEE International Conference on Management of Innovation and Technology, ICMIT 2016, Thailand, 19-22 September 2016
ISBN: 9781509015009
DOI: 10.1109/ICMIT.2016.7605020
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Checked on Aug 21, 2017

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.