| 一种并行的多群蚁群算法研究与应用 |
| |
| 引用本文： | 方昕. 一种并行的多群蚁群算法研究与应用[J]. 计算机与数字工程, 2012, 40(8): 5-7,11 |
| |
| 作者姓名： | 方昕 |
| |
| 作者单位： | 安康学院电子与信息工程系 安康725000 |
| |
| 基金项目： | 安康学院计算机应用技术重点学科项目，陕西省计算机科学与技术研究项目，安康学院计算机科学与技术重点学科项目资助 |
| |
| 摘 要： | 针对蚁群算法易出现早熟收敛的缺陷,蚁群按照一定比例分解为具有启发信息的多种群,同时利用多核系统发挥蚁群算法并行性,提出一种并行的多群蚁群算法。该算法在初始化蚁群时产生带有启发信息的多种群,多种群采用多核系统并行处理方式相对独立求解最短路径。在求解过程中每个群体可分享路径信息,当某个种群求解到最短路径时即生成整个群体全局最短路径,从而保证种群多样性,算法求解速率及全局搜索均衡性。实验以Visual Studio2005中C＋＋编程实现仿真,结果表明此算法不但能有效求解GIS的最短路径,而且综合改善了算法性能。
|
| 关 键 词： | 并行处理 最短路径 启发信息 多群蚁群算法 |
Research and Application of Parallel Multi-colony Ant Algorithm |
| |
| FANG Xin. Research and Application of Parallel Multi-colony Ant Algorithm[J]. Computer and Digital Engineering, 2012, 40(8): 5-7,11 |
| |
| Authors: | FANG Xin |
| |
| Affiliation: | FANG Xin(Dept.of Electronic and Information Engineering,Ankang University,Ankang 725000) |
| |
| Abstract: | To solve premature convergence of Ant Colony Algorithm(ACO),ant colony decomposes a variety of groups with heuristic information in accordance with a certain percentage.At the same time,taking advantage of multicore system plays paralleling.Parallel multi-colony ant algorithm(PMACO) produces a variety of groups with heuristic information when initiating ant colony.The groups use multicore parallel processing to relatively independent to solve the shortest path.Every group can shares the path information in the solving process.When one group solves the shortest path,ant colony gets a global shortest path in order to ensure the diversity,the solving speed and global search balance.Experiment uses C++ programming of Visual Studio 2005.net.The results show that this algorithm can not only effectively solve the shortest path problem of GIS,but also comprehensive improves the performance of the PMACO. |
| |
| Keywords: | parallel processing shortest path heuristic information multi-colony ant algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
