.png){kind=icon}
返回
Emergency resources scheduling based on adaptively mutate genetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.chb.2010.10.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The emergency resources dispatch is critical in emergency relief, while it is quite difficult to achieve an optimized scheduling, adjusting to a practical situation. In this paper, an emergency resources scheduling model is built, which simulates realistic problems, this model includes multiple suppliers with a variety of resources, a single accident site and some restrictions, all these elements closing to a practical event. Then we applied an adaptively mutate genetic algorithm to figure out a superior solution, which adopts the Binary Space Partitioning tree for heuristic searching and adaptive mutation. Finally, we compare the experimental results obtained by canonical genetic algorithm and the adaptively mutate genetic algorithm, respectively. As is observed, this novel method proposed in our work has acquired better solutions than canonical genetic algorithm. (C) 2011 Published by Elsevier Ltd.
Keyword:
Emergency resources scheduling
BSP tree
Adaptively mutate
Genetic algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
9.1K
被引数:
5.8W
机构
引用论文
.png){kind=icon}
没有更多内容
没有更多内容