Polynomial-Time Feasibility Condition for Multiclass Aircraft Sequencing on a Single-Runway Airport

Harikiopoulo, Dimitri; Neogi, Natasha A.

doi:10.1109/tits.2010.2055856

Cited by 22 publications

(12 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furini et al (2014) generalize this approach to continuous time. Harikiopoulo and Neogi (2011) present an efficient DP algorithm for makespan minimization. Lieder et al (2015) propose a DP-based optimization algorithm with fast computation times for multiple runways.…”

Section: Optimizing Solution Approachesmentioning

confidence: 99%

Scheduling aircraft take-offs and landings on interdependent and heterogeneous runways

Lieder

Stolletz

2016

Transportation Research Part E: Logistics and Transportation Re

View full text Add to dashboard Cite

Section: Optimizing Solution Approachesmentioning

confidence: 99%

Scheduling aircraft take-offs and landings on interdependent and heterogeneous runways

Lieder

Stolletz

2016

Transportation Research Part E: Logistics and Transportation Re

View full text Add to dashboard Cite

“…However, the ASS problems of shortening the required landing time (Balakrishnan and Chandran 2006;Bojanowski et al 2011;Ghoniem et al 2014;Hrikiopoulo and Neogi 2011;Hu and Chen 2005a, b;Malaek and Naderi 2008) and minimizing the total airborne delay (Hu and Chen 2005a, b;Hu and Di 2008;Sun and Hua 2009;Wang et al 2008;Zhan et al 2010) are essentially different optimization problems (Psaraftis 1978). A sequence that has a lower airborne delay may lead to a longer required landing time.…”

Section: Previous Workmentioning

confidence: 99%

An evolutionary approach for dynamic single-runway arrival sequencing and scheduling problem

Cao

Wei

et al. 2016

Soft Comput

View full text Add to dashboard Cite

Aircraft arrival sequencing and scheduling is a classic problem in the air traffic control to ensure safety and order of the operations at the terminal area. Most of the related studies have formulated this problem as a static case and assume the information of all the flights is known in advance. However, the operation of the terminal area is actually a dynamic incremental process. Various kinds of uncertainties may exist during this process, which will make the scheduling decision obtained in the static environment inappropriate. In this paper, aircraft arrival sequencing and scheduling problem is tackled in the form of a dynamic optimization problem. An evolutionary approach, namely dynamic sequence searching and evaluation, is proposed. The proposed approach employs an estimation of distribution algorithm and a heuristic search method to seek the optimal landing sequence of flights. Compared with other related algorithms, the proposed method performs much better on several test instances including an instance obtained from the real data of the Beijing Capital International Airport.

show abstract

“…Dynamic programming approaches: DP approaches for the ASP are presented by, e.g., Balakrishnan and Chandran (2010), Harikiopoulo andNeogi (2011), Furini et al (2014), Lieder et al (2015). These approaches exhibit fast computation times but have additional assumptions that simplify the underlying problem.…”

Section: Optimizing Solution Approachesmentioning

confidence: 99%

Scheduling Aircraft Take-Offs and Landings on Interdependent and Heterogeneous Runways

Lieder

Stolletz

2015

SSRN Journal

View full text Add to dashboard Cite

Polynomial-Time Feasibility Condition for Multiclass Aircraft Sequencing on a Single-Runway Airport

Cited by 22 publications

References 13 publications

Scheduling aircraft take-offs and landings on interdependent and heterogeneous runways

Scheduling aircraft take-offs and landings on interdependent and heterogeneous runways

An evolutionary approach for dynamic single-runway arrival sequencing and scheduling problem

Scheduling Aircraft Take-Offs and Landings on Interdependent and Heterogeneous Runways

Contact Info

Product

Resources

About