An Efficient Approximation Algorithm for Aircraft Arrival Sequencing and Scheduling Problem
Joint Authors
Ma, Weimin
Xu, Bo
Huang, Hui
Liu, Ming
Source
Mathematical Problems in Engineering
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-8, 8 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-12-31
Country of Publication
Egypt
No. of Pages
8
Main Subjects
Abstract EN
The aircraft arrival sequencing and scheduling (ASS) problem is a salient problem in airports' runway scheduling system, which proves to be nondeterministic polynomial (NP) hard.
This paper formulates the ASS in the form of a constrained permutation problem and designs a new approximation algorithm to solve it.
Then the numerical study is conducted, which validates that this new algorithm has much better performance than ant colony (AC) algorithm and CPLEX, especially when the aircraft types are not too many.
In the end, some conclusions are summarized.
American Psychological Association (APA)
Ma, Weimin& Xu, Bo& Liu, Ming& Huang, Hui. 2014. An Efficient Approximation Algorithm for Aircraft Arrival Sequencing and Scheduling Problem. Mathematical Problems in Engineering،Vol. 2014, no. 2014, pp.1-8.
https://search.emarefa.net/detail/BIM-1044102
Modern Language Association (MLA)
Ma, Weimin…[et al.]. An Efficient Approximation Algorithm for Aircraft Arrival Sequencing and Scheduling Problem. Mathematical Problems in Engineering No. 2014 (2014), pp.1-8.
https://search.emarefa.net/detail/BIM-1044102
American Medical Association (AMA)
Ma, Weimin& Xu, Bo& Liu, Ming& Huang, Hui. An Efficient Approximation Algorithm for Aircraft Arrival Sequencing and Scheduling Problem. Mathematical Problems in Engineering. 2014. Vol. 2014, no. 2014, pp.1-8.
https://search.emarefa.net/detail/BIM-1044102
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1044102