Scheduling of airport runway operations using stochastic branch and bound methods

作     者：Soelveling, Gustaf Clarke, John-Paul 

作者机构：Georgia Inst Technol Sch Ind & Syst Engn Atlanta GA 30332 USA Georgia Inst Technol Sch Aerosp Engn Atlanta GA 30332 USA 

出 版 物：《TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES》 (运输研究C部分：新兴技术)

年 卷 期：2014年第45卷

页      面：119-137页

核心收录：

学科分类：08[工学] 0823[工学-交通运输工程] 

主　　题：Stochastic programming Stochastic aircraft scheduling Stochastic branch-and-bound algorithm Machine scheduling 

摘      要：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. (C) 2014 Elsevier Ltd. All rights reserved.