Unmanned Aerial Vehicles Rapid Delivery Routing of the Emergency Rescue in the Complex Mountain Region

Unmanned Aerial Vehicles rapid delivery routing of the emergency rescue in the complex mountain region was studied as a multistage decision problem. Firstly, the problem is defined in graph theory and the solving framework is analyzed. Secondly, the dynamic programming model is developed due to its multistage characteristic. Thirdly, the tabu list for the dynamic programming model is introduced so that the optimal routing of UAVs can be computed through solving a minimum cost flow problem. Finally, the effectiveness of the dynamic programming model and algorithm is verified through an example.