Research on vehicle scheduling for forest fires in the northern Greater Khingan Mountains.

In the face of forest fire emergencies, fast and efficient dispatching of rescue vehicles is an important means of mitigating the damage caused by forest fires, and is an effective method of avoiding secondary damage caused by forest fires, minimizing the damage caused by forest fires to the ecosystem, and mitigating the losses caused by economic development. this paper takes the actual problem as the starting point, constructs a reasonable mathematical model of the problem, for the special characteristics of the emergency rescue vehicle scheduling problem of forest fires, taking into account the actual road conditions in the northern pristine forest area, through the analysis of the cost of paths between the forest area and the highway, to obtain the least obstructed rescue paths, to narrow the gap between the theoretical model and the problem of the actual. Improvement of ordinary genetic algorithm, design of double population strategy selection operation, the introduction of chaotic search initialization population, to improve the algorithm's solution efficiency and accuracy, through the northern pristine forest area of Daxing'anling real forest fire cases and generation of large-scale random fire point simulation experimental test to verify the effectiveness of the algorithm, to ensure that the effectiveness and reasonableness of the solution to the problem of forest fire emergency rescue vehicle scheduling program. It enriches the solution method of forest fire emergency rescue vehicle dispatching problem in Great Khingan area, which is of great significance to improve the emergency rescue capability in case of sudden forest fire. Through simulation experiments, the proposed Improved Genetic Algorithm (IGA) achieved an average rescue time reduction of 8.5% compared to conventional Genetic Algorithm (GA) and 3.5% compared to Improved Artificial Bee Colony (IABC) algorithm, with an average solution time of 9.4 ms.