Scheduling of airport runway operations using stochastic branch and bound methods |
| |
| Affiliation: | 1. School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA 30332, USA;2. School of Aerospace Engineering, Georgia Institute of Technology, 270 Ferst Drive, Atlanta, GA 30332, USA;1. ASAP Research Group, The University of Nottingham Malaysia Campus, Jalan Broga, Semenyih 43500, Selangor, Malaysia.;2. ASAP Research Group, The University of Nottingham, Nottingham, UK;1. ENAC, University de Toulouse, 7 Avenue Edouard Belin, Toulouse 31055, France;2. Aviation Academy, Amsterdam University of Applied Sciences, Amsterdam, the Netherlands |
| |
| Abstract: | 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 1 min of computation time. |
| |
| Keywords: | Stochastic programming Stochastic aircraft scheduling Stochastic branch-and-bound algorithm Machine scheduling |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
