| 求解最短路径问题的一种改进的人工蜂群算法 |
| |
| 引用本文： | 张涛,陈忠,吕一兵. 求解最短路径问题的一种改进的人工蜂群算法[J]. 青海师范大学学报(自然科学版), 2013, 29(1): 5-7,13 |
| |
| 作者姓名： | 张涛 陈忠 吕一兵 |
| |
| 作者单位： | 1. 长江大学信息与数学学院,湖北荆州434023;水资源与水电科学国家重点实验室(武汉大学),湖北武汉430072
2. 长江大学信息与数学学院,湖北荆州,434023 |
| |
| 基金项目： | 国家自然科学基金，湖北省教育厅重点项目 |
| |
| 摘 要： | 针对传统算法在计算大规模路网的优化问题时所表现出来的计算时间长、存储空间大等缺点，提出了一种改进的人工蜂群算法来求解最优路径选择的方法．试验结果表明，对于有向图和无向图，该算法都具有较好的全局寻优能力，即能获得满足条件的最优路径．
|
| 关 键 词： | 人工蜂群算法 最短路径问题 适应度值 |
An improved artificial bee colony algorithm for solving the shortest path problem |
| |
| ZHANG Tao , CHENG Zhong , LV Yi-bing. An improved artificial bee colony algorithm for solving the shortest path problem[J]. Journal of Qinghai Normal University(Natural Science Edition), 2013, 29(1): 5-7,13 |
| |
| Authors: | ZHANG Tao CHENG Zhong LV Yi-bing |
| |
| Affiliation: | 1. School of Information and Mathematics, Yangtze University, Jingzhou 434023,China; 2. State Key Laboratory of Water Resource and Hydropower Engineering Science, Wuhan University,Wuhan 430072, China) |
| |
| Abstract: | It is noted that the traditional algorithms for the large--scale road network optimization problem need long computing time and large storage space, an improved artificial bee colony algorithm is proposed for solving the shortest path problem in this paper. We use two different test problems to measure and evaluate the proposed algorithm, including the directed graph and the undirected graph, and the experimental results show that the proposed algorithm has better global optimization ability namely that it can obtained the optimization path which satisfy the conditions. |
| |
| Keywords: | artificial bee colony algorithm the shortest path problem fitness |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
