An Aircraft Sequencing Approach Based on Fuzzy Petri-net

Sun, Shiwen; Ke-qiang, Hua

doi:10.1109/cso.2009.157

Cited by 5 publications

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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: 98%

“…Many kinds of objective functions of ASS have been studied, such as 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), makespan of landing time (Balakrishnan and Chandran 2006;Dear 1976;Psaraftis 1978Psaraftis , 1980 and extra costs generated by the deviation of assigned landing times (ALT) (Beasley et al 2000(Beasley et al , 2001(Beasley et al , 2004Guo et al 2008Guo et al , 2009Jia et al 2008;Tang et al 2008;Wang 2009;Yu et al 2011;Zhang et al 2007). In fact, ensuring safety of TMA is always the top priority for airline industry (Psaraftis 1978).…”

Section: Problem Formulationmentioning

confidence: 98%

See 1 more Smart Citation

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