An Efficient Approximation Algorithm for Aircraft Arrival Sequencing and Scheduling Problem

Weimin Ma, Bo Xu, Ming Liu and Hui Huang

Mathematical Problems in Engineering, 2014, vol. 2014, 1-8

Abstract:

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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2014/236756.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2014/236756.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:236756

DOI: 10.1155/2014/236756

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().