An Efficient Ant Colony Algorithm Based on Rank 2 Matrix Approximation Method for Aircraft Arrival/Departure Scheduling Problem

The Aircraft Arrival/Departure Problem (AADSP) is the core problem in current runway system, even has become the bottleneck to prevent the improvement of the airport efficiency. This paper studies the single runway AADSP. A Mixed Integer Programming (MIP) model is constructed and an algorithm named...

Full description

Saved in:
Bibliographic Details
Published inProcesses Vol. 10; no. 9; p. 1825
Main Authors Xu, Bo, Ma, Weimin, Ke, Hua, Yang, Wenjuan, Zhang, Hao
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.09.2022
Subjects
Air transportation industry
Aircraft
Airports
Algorithms
Ant colony optimization
Approximation
Aviation
Design
Efficiency
Integer programming
Linear programming
Mathematical analysis
Methods
Mixed integer
Runways
Scheduling
Traffic congestion
Iran
Online AccessGet full text
ISSN2227-9717
2227-9717
DOI10.3390/pr10091825

Cover

More Information
Summary:The Aircraft Arrival/Departure Problem (AADSP) is the core problem in current runway system, even has become the bottleneck to prevent the improvement of the airport efficiency. This paper studies the single runway AADSP. A Mixed Integer Programming (MIP) model is constructed and an algorithm named Ant Colony based on Rank 2 Matrix Approximation (RMA-AC) method is proposed. Numerical results validate that the new algorithm, as well as the new model, exhibits better performance than CPLEX and the traditional two-phase algorithm. The runway efficiency enhanced by RMA-AC, within 20 s computation, is about 2–5% even for the 800 aircraft sequences. It is a promising method to improve the efficiency of the future aircraft scheduling system.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2227-9717
2227-9717
DOI:10.3390/pr10091825