Effective path planning is crucial for mobile robots to quickly reach rescue destination and complete rescue tasks in a post-disaster *** this study,we investigated the post-disaster rescue path planning problem and m...
详细信息
Effective path planning is crucial for mobile robots to quickly reach rescue destination and complete rescue tasks in a post-disaster *** this study,we investigated the post-disaster rescue path planning problem and modeled this problem as a variant of the travel salesman problem(TSP)with life-strength *** address this problem,we proposed an improved iterated greedy(IIG)***,a push-forward insertion heuristic(PFIH)strategy was employed to generate a high-quality initial ***,a greedy-based insertion strategy was designed and used in the destruction-construction stage to increase the algorithm’s exploration ***,three problem-specific swap operators were developed to improve the algorithm’s exploitation ***,an improved simulated annealing(SA)strategy was used as an acceptance criterion to effectively prevent the algorithm from falling into local *** verify the effectiveness of the proposed algorithm,the Solomon dataset was extended to generate 27 instances for ***,the proposed IIG was compared with five state-of-the-art *** parameter analysiswas conducted using the design of experiments(DOE)Taguchi method,and the effectiveness analysis of each component has been verified one by *** results indicate that IIGoutperforms the compared algorithms in terms of the number of rescue survivors and convergence speed,proving the effectiveness of the proposed algorithm.
暂无评论