An Improved Iterated Greedy Algorithm for Solving Collaborative Helicopter Rescue Routing Problem with Time Window and Limited Survival Time DOI Creative Commons
Xining Cui,

Kaidong Yang,

Xiaoqing Wang

и другие.

Algorithms, Год журнала: 2024, Номер 17(10), С. 431 - 431

Опубликована: Сен. 26, 2024

Research on helicopter dispatching has received considerable attention, particularly in relation to post-disaster rescue operations. The survival chances of individuals trapped emergency situations decrease as time passes, making timely dispatch crucial for successful missions. Therefore, this study investigates a collaborative routing problem with window and limited constraints, solving it using an improved iterative greedy (IIG) algorithm. In the proposed algorithm, heuristic initialization strategy is designed generate efficient feasible initial solution. Then, feasible-first destruction-construction applied enhance algorithm’s exploration ability. Next, problem-specific local search developed improve effectiveness. addition, simulated annealing (SA) method integrated acceptance criterion avoid algorithm from getting optima. Finally, evaluate efficacy IIG, 56 instances were generated based Solomon used simulation tests. A comparative analysis was conducted against six algorithms existing studies. experimental results demonstrate that performs well problem.

Язык: Английский

An Improved Iterated Greedy Algorithm for Solving Collaborative Helicopter Rescue Routing Problem with Time Window and Limited Survival Time DOI Creative Commons
Xining Cui,

Kaidong Yang,

Xiaoqing Wang

и другие.

Algorithms, Год журнала: 2024, Номер 17(10), С. 431 - 431

Опубликована: Сен. 26, 2024

Research on helicopter dispatching has received considerable attention, particularly in relation to post-disaster rescue operations. The survival chances of individuals trapped emergency situations decrease as time passes, making timely dispatch crucial for successful missions. Therefore, this study investigates a collaborative routing problem with window and limited constraints, solving it using an improved iterative greedy (IIG) algorithm. In the proposed algorithm, heuristic initialization strategy is designed generate efficient feasible initial solution. Then, feasible-first destruction-construction applied enhance algorithm’s exploration ability. Next, problem-specific local search developed improve effectiveness. addition, simulated annealing (SA) method integrated acceptance criterion avoid algorithm from getting optima. Finally, evaluate efficacy IIG, 56 instances were generated based Solomon used simulation tests. A comparative analysis was conducted against six algorithms existing studies. experimental results demonstrate that performs well problem.

Язык: Английский

Процитировано

0