Scheduling of airport runway operations using stochastic branch and bound methods

•We present a solution methodology for the stochastic runway scheduling problem.•The stochastic branch and bound algorithm is used find optimal/good sequences.•A method to dynamically update the sample sizes for bound estimation is proposed.•Algorithm gives solutions with 5–7% shorter makespan than...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Transportation research. Part C, Emerging technologies Ročník 45; s. 119 - 137
Hlavní autoři: Sölveling, Gustaf, Clarke, John-Paul
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier India Pvt Ltd 01.08.2014
Témata:
Aircraft
Airport runways
Algorithms
Computation
Machine scheduling
Mathematical models
Optimization
Scheduling
Stochastic aircraft scheduling
Stochastic branch-and-bound algorithm
Stochastic programming
Stochasticity
Machine scheduling
Stochastic branch-and-bound algorithm
Stochastic aircraft scheduling
Stochastic programming
ISSN:0968-090X, 1879-2359
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•We present a solution methodology for the stochastic runway scheduling problem.•The stochastic branch and bound algorithm is used find optimal/good sequences.•A method to dynamically update the sample sizes for bound estimation is proposed.•Algorithm gives solutions with 5–7% shorter makespan than deterministic model. In this paper we present a solution methodology based on the stochastic branch and bound algorithm to find optimal, or close to optimal, solutions to the stochastic airport runway scheduling problem. The objective of the scheduling problem is to find a sequence of aircraft operations on one or several runways that minimizes the total makespan, given uncertain aircraft availability at the runway. Enhancements to the general stochastic branch and bound algorithm are proposed and we give the specific details pertaining to runway scheduling. We show how the algorithm can be terminated early with solutions that are close to optimal, and investigate the impact of the uncertainty level. The computational experiment indicates that the sequences obtained using the stochastic branch and bound algorithm have, on average, 5–7% shorter makespans than sequences obtained using deterministic sequencing models. In addition, the proposed algorithm is able to solve instances with 14 aircraft using less than 1min of computation time.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0968-090X
1879-2359
DOI:10.1016/j.trc.2014.02.021