A constraint programming model and a hybrid iterated local search algorithm for solving an aircraft recovery problem in the oil and gas industry
针对巴西油气公司因天气或机械故障导致的直升机航班重新调度问题，提出约束规划模型和混合迭代局部搜索算法，以最小化延误和直升机使用量，并用实际数据验证了有效性。
In this paper, we address a challenging problem faced by a Brazilian oil and gas company regarding the rescheduling of helicopter flights from an onshore airport to maritime units, crucial for transporting company employees. The problem arises due to unforeseen events like bad weather or mechanical failures, leading to delays or postponements in the original flight schedules, disrupting the operation of maritime units, and employee shift scheduling. To model and solve the problem, we propose a constraint programming (CP) model aimed at optimizing daily flight scheduling with minimal delay and helicopter usage, considering various constraints like rescheduling priorities and time windows. We also develop a hybrid iterated local search algorithm to handle larger instances of the problem for the case when a general-purpose CP solver may not be available. Our approaches, evaluated using real-world data, demonstrate their effectiveness in solving short-term flight rescheduling problems in the context of the oil and gas industry, in comparison to exact and heuristic approaches from the literature.