Scenario-based stochastic programming for an airline-driven flight rescheduling problem under ground delay programs

作     者：Woo, Young-Bin Moon, Ilkyeong 

作者机构：Seoul Natl Univ Dept Ind Engn Seoul South Korea Seoul Natl Univ Inst Ind Syst Innovat Seoul South Korea 

出 版 物：《TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW》 (运输研究E部分：后勤学与运输评论)

年 卷 期：2021年第150卷

页      面：102360-102360页

核心收录：

学科分类：0201[经济学-理论经济学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 0814[工学-土木工程] 0823[工学-交通运输工程] 

基　　金：Jungseok Logistics Foundation 

主　　题：Ground delay programs Scenario-based stochastic programming Airline operations Flight rescheduling 

摘      要：We address an airline-driven flight rescheduling problem within a single airport in which a series of ground delay programs (GDPs) are considered. The objective of the problem is to minimize an airline s total relevant cost (TRC) consisting of delay costs, misconnection costs, and cancellation costs that would result from flight rescheduling. We introduce three solution approaches-the greedy approach, the stochastic approach, and the min-max approach-that revise the daily flight scheduling whenever the schedule is affected by a GDP or further GDP changes. The greedy approach simply searches for a solution using currently updated static GDP information, and the other two approaches provide a solution by considering possible scenarios for changes of the GDP. Using real-world data in existing literature and some generated scenarios, we present extensive computational results to assess the performance of the approaches. We also report the values of information on GDP the solution approaches refer to. Deliberating various cost parameter settings an airline might consider, we discuss the value of information in implementing the proposed solution approaches.