A Helicopter Scheduling Model for Flood Aviation Emergency Rescue Considering Bilateral Matching and Time Satisfaction

This paper investigates the scheduling of rescue helicopters after flood disasters. In order to improve rescue efficiency and robustness, this study considers the matching degree between the capabilities of helicopters and the demands of rescue tasks, as well as the time satisfaction of the rescue tasks. The bilateral matching degree is described by the matching perception satisfaction of the rescue helicopters and the rescue tasks based on prospect theory, and the time satisfaction of the rescue tasks is evaluated by a piecewise linear function based on the soft time window method. A scheduling model for emergency rescue helicopters is established to maximize the matching perception satisfaction and task time satisfaction. The non-dominated sorting genetic algorithm with elite strategy (NSGA-II) is used to solve the model and an optimal scheduling solution set containing the task assignment and execution order for each helicopter can be obtained. Finally, the rescue of the floods in Zhejiang Province is used as an example to verify the feasibility and effectiveness of the model and algorithm from multiple perspectives, which demonstrates that the model in this paper can improve the effectiveness and efficiency of rescue.