Solving long haul airline disruption problem caused by groundings using a distributed fixed-point computational approach to integer programming

作     者：Wu, Zhengtian Li, Benchi Dang, Chuangyin Hu, Fuyuan Zhu, Qixin Fu, Baochuan 

作者机构：Suzhou Univ Sci & Technol Suzhou Jiangsu Peoples R China City Univ Hong Kong Hong Kong Hong Kong Peoples R China 

出 版 物：《NEUROCOMPUTING》 (神经计算)

年 卷 期：2017年第269卷

页      面：232-255页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Hong Kong SAR Government [CityU 11301014] National Nature Science Foundation of China [51375323, 61472267, 61563022, 71471091, 71271119] Jiangsu Provincial Department of Housing and Urban-Rural Development [2016ZD49] Research Foundation of USTS [XKQ201517] 

主　　题：Airline disruption management Irregular operation Fixed-point method Integer programming Distributed computation Lexicographical order MPI 

摘      要：Disruptions are prevalent phenomenons that prevent airline from operating as original scheduled. This paper adopts the iterative fixed-point method for integer programming proposed by Dang and Ye [1] to generate feasible flight routes that are used to construct an aircraft reassignment in response to the grounding of one aircraft. Two division methods are proposed with which the solution space can be divided into several independent segments and implemented a distributed computation. The second division method is emphasized in this paper for the good performance of partial feasible flight routes which are generated by this division approach. Comparison with CPLEX CP Optimizer [2] shows that less partial feasible flight routes which are generated by Dang s algorithm [1] are required to find an aircraft reassignment when disruptions happen, and this division method is more promising when dealing with long haul airline disruption problem. (C) 2017 Elsevier B.V. All rights reserved.