Resumen
The scheduling of rescue aircraft needs to be studied in depth because of its criticality for the general aviation rescue of forest fires. This paper constructs a collaborative schedule optimization model for general aviation rescue under the condition of multiple aircraft, from multiple rally points to multiple fire points, targeting the shortest rescue time and the lowest rescue cost in the context of forest fires based on the simulation verification of a forest fire that broke out simultaneously in multiple locations in Liangshan Prefecture, Sichuan Province, China. The Non-dominated Sorting Genetic Algorithm II (NSGA-II) algorithm was used to find the optimal set of solutions satisfying the objective function: four feasible solutions. Then, the optimal solution was solved based on the weighted TOPSIS method, which was the optimal solution for this rescue task. The simulation results show that unnecessary flight times can be reduced by optimizing the schedule plan. Under the premise of ensuring rescue timeliness, the utilization rate of rescue aircraft was improved, and rescue costs were further reduced. The presented work provides a theoretical reference for the efficient development of general aviation rescue.