{"title":"Unmanned Aerial Vehicles Rapid Delivery Routing of the Emergency Rescue in the Complex Mountain Region","authors":"Zhihua Song, Han Zhang, Y. Wang, Linghui Zhang","doi":"10.1109/CIS.2017.00081","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"357 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 13th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2017.00081","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
