| 基于遗传算法优化多出口疏散路径问题 |
| |
| 引用本文： | 李晶晶,纪庆革,. 基于遗传算法优化多出口疏散路径问题[J]. 上海师范大学学报(自然科学版), 2008, 37(4): 383-389 |
| |
| 作者姓名： | 李晶晶 纪庆革 |
| |
| 作者单位： | 中山大学,软件学院,广州,510275;中山大学,信息科学与技术学院,广州,510275 |
| |
| 基金项目： | 国家自然科学基金，广东省教育部联合基金 |
| |
| 摘 要： | 提出了一种基于遗传算法来优化疏散路径问题的方法．首先将疏散路径图转换为等价的距离完全图，将目标点、源点和中间点分离，随机选取中间点构造最小生成树，最终用遗传算法得到最优路径．通过数值实验，验证了算法的有效性，并与传统方法进行了比较．
|
| 关 键 词： | 人群疏散 最佳路径 遗传算法 最小生成树 |
Research on GA-based optimizing multi-exit evacuation path problem |
| |
| LI Jing-jing,JI qing-ge. Research on GA-based optimizing multi-exit evacuation path problem[J]. Journal of Shanghai Normal University(Natural Sciences), 2008, 37(4): 383-389 |
| |
| Authors: | LI Jing-jing JI qing-ge |
| |
| Affiliation: | LI Jing-jing , JI qing-ge (1. Software School, Zhong Shan University, Guangzhou 510275, China; 2. School of Information Science and Technology, Zhong Shan University, Guangzhou 510275, China) |
| |
| Abstract: | Shortest path problem is the key for research and application of crowd evacuation. This paper presents a GA - based method of optimization for multi - exit evacuation path problem. The proposed algorithm first transforms the route graph of a problem to the corresponding distance complete graph, then separates the destination, source and middle points, selects randomly the middle points to get the minimum spanning tree, finally uses the genetic algorithm to get the minimum cost route as the optimized path. Through the numerical value experience, this proves the effectiveness of proposed algorithm of the paper, and it is compared with traditional method. |
| |
| Keywords: | crowd evacuation best path GA minimum spanning tree |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《上海师范大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《上海师范大学学报(自然科学版)》下载免费的PDF全文 |
|
