A Fast Tabu Search Algorithm for the Emergency Route Planning for Forest Fires with Priority Level

This work studies an emergency routing scheduling problem for the forest fire patrol. It aims to plan the optimal routes for patrolling the high-risk places with priority levels. The objective of the problem is to minimize the total travel time of all the patrol vehicles, so that the forest fire can be discovered at early time if it happens. To study the problem, an integer programming (IP) model is formulated for it. Then a fast tabu search based algorithm is proposed to solve the problem. Numerical experiments are conducted and computational results are compared with CPLEX. It is shown that the formulated model is effective and the proposed algorithm is efficient to obtain near-optimal solutions, which can provide useful information decision makers for emergence management.