An Improved Iterated Greedy Algorithm for Solving Collaborative Helicopter Rescue Routing Problem with Time Window and Limited Survival Time

Research on helicopter dispatching has received considerable attention, particularly in relation to post-disaster rescue operations. The survival chances of individuals trapped in emergency situations decrease as time passes, making timely helicopter dispatch crucial for successful rescue missions....

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithms Ročník 17; číslo 10; s. 431
Hlavní autoři:	Cui, Xining, Yang, Kaidong, Wang, Xiaoqing, Duan, Peng
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Basel MDPI AG 01.10.2024
Témata:	Acceptance criteria Algorithms Collaboration collaborative helicopter rescue routing problem Disasters Effectiveness Emergency procedures Energy consumption Evacuations & rescues Greedy algorithms Helicopter performance Helicopters Heuristic improved iterated greedy algorithm limited survival time Literature reviews Mathematical optimization Methods Neural networks Optimization post-disaster rescue Rescue operations Rescue work Scheduling Scheduling (Management) Search and rescue missions Search methods Simulated annealing Survival time windows Windows (intervals) China
ISSN:	1999-4893, 1999-4893
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!