Scheduling of airport runway operations using stochastic branch and bound methods

Sölveling, Gustaf; Clarke, John‐Paul

doi:10.1016/j.trc.2014.02.021

Cited by 54 publications

(23 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A 'first-come-firstserved' (FCFS) principle is accepted as a fair method of sequencing aircraft at most airports. In FCFS policy, aircraft are sequenced based on expected approach time (EAT) to a runway or a given point (43,44) . The results of the RTS analyses present that FCFS could be provided by implementing the LH procedure.…”

Section: Resultsmentioning

confidence: 99%

“…Moreover, other studies attempt to harmonize ground delay strategies by including cruising speed adjustments (9)(10)(11)(12)(13) , scheduling and sequencing traffic flows with different optimization models (14)(15)(16) . Furthermore, Akturk et al (17) focus on fuel consumption and CO 2 emissions costs incorporating cruise speed control by proposing a novel rescheduling optimization model.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A proposed solution for airborne delays: linear holding

Şahin

2019

Aeronaut. j.

View full text Add to dashboard Cite

This study is aimed at establishing a linear holding (LH) procedure instead of a conventional air holding stack to minimize the effects of airborne delays in terms of air traffic management and fuel consumption. This paper uses both actual flight data and the Base of Aircraft Database (BADA) model to obtain fuel consumption for level flight and descent segments, separately.The total fuel savings obtained by using actual flight data (16%) and the BADA model (10%) indicate that the LH is found to be more advantageous compared to a conventional holding procedure. Furthermore, the recommended LH procedure could be a promising solution for keeping aircraft in a narrow area that could be considered to be an effective method for airspace usage.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A proposed solution for airborne delays: linear holding

Şahin

2019

Aeronaut. j.

View full text Add to dashboard Cite

show abstract

“…The case in which predicted operations times are known with certainty, called the deterministic case, has been thoroughly studied in the literature [4,7,8], while the case under uncertainty has less often been addressed. So far in the related literature, three main approaches to optimization under uncertainty were applied to ASSP: probabilistic [9,10], stochastic [11][12][13] and robust [14][15][16] approaches. Pioneer studies such as [9,10] mainly enriched deterministic models by probability constraints and/or by a probability objective-value function.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Pioneer studies such as [9,10] mainly enriched deterministic models by probability constraints and/or by a probability objective-value function. Stochastic programming models, including two-stage and multi-stage models, were proposed in [11][12][13].…”

Section: Literature Reviewmentioning

confidence: 99%

Extended Aircraft Arrival Management Under Uncertainty: A Computational Study

Khassiba

Bastin²,

Gendron³

et al. 2019

Journal of Air Transportation

View full text Add to dashboard Cite

Arrival Manager operational horizon, in Europe, is foreseen to be extended up to 500 nautical miles around destination airports. In this context, arrivals need to be sequenced and scheduled a few hours before landing, when uncertainty is still significant. A computational study, based on a two-stage stochastic program, is presented and discussed to address the arrival sequencing and scheduling problem under uncertainty. This preliminary study focuses on a single Initial Approach Fix and a single runway. Different problem characteristics, optimization parameters as well as fast solution methods for real-time implementation are analyzed in order to evaluate the viability of our approach. Paris Charles-De-Gaulle airport is taken as a case study. A simulation-based validation experiment shows that our approach can decrease the number of expected conflicts near the terminal area by up to 70%. Moreover, in a high-density traffic situation, the total time-to-lose inside the terminal area can be decreased by more than 71%, while the expected landing rate can be increased by 7.7%, compared to the first-come first-served policy. This computational study demonstrates that sequencing and scheduling arrivals under uncertainty, a few hours before landing, can successfully diminish the need for holding stacks by relying more on upstream linear holding.

show abstract

“…Many research efforts have been made to tackle the ASS problem, both from the perspective of modeling the problem (Beasley et al 2000(Beasley et al , 2001(Beasley et al , 2004Dear 1976;Psaraftis 1978Psaraftis , 1980, as well as developing various optimization approaches for solving it, including mathematical programming (Faye 2015;Lieder et al 2015;Ma et al 2014;Sölveling and Clarke 2014;Tavakkoli-Moghaddam et al 2012) and heuristic algorithms (Guo et al , 2009Jia et al 2008;Tang et al 2008;Wang et al 2008;Yu et al 2011). As early as 1978, a simplified version of the ASS is investigated, in which all the flights are supposed to land immediately and the flights with the same type are considered to be equivalent.…”

Section: Introductionmentioning

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

Scheduling of airport runway operations using stochastic branch and bound methods

Cited by 54 publications

References 28 publications

A proposed solution for airborne delays: linear holding

A proposed solution for airborne delays: linear holding

Extended Aircraft Arrival Management Under Uncertainty: A Computational Study

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

Contact Info

Product

Resources

About