计算机与现代化Issue(10)：6-9,4.DOI:10.3969/j.issn.1006-2475.2016.10.002
基于MapReduce的混合蚁群算法研究
A Hybrid Ant Colony Algorithm Based on MapReduce
蔡明 1左勇安1
作者信息
- 1. 江南大学物联网工程学院，江苏 无锡 214122
- 折叠
摘要
Abstract
The traditional ant colony algorithm has a slow rate of convergence and is easy to result in local optimal solution. This paper raises a new hybrid ant colony algorithm, which is based on a mixed mode of elite mode and normal mode. The algorithm selects a mode proportionally in each iteration to obtain the optimal path. In this way, we are able to find the optimal path in a less time and avoid falling into local optimal solution. Because of the parallel property of ant colony algorithm, it’ s feasible to use MapReduce to run it. Experimental results show that the MapReduce-based hybrid ant colony algorithm can find out the optimum path in a relatively less time.关键词
蚁群算法/混合蚁群算法/MapReduce/云计算Key words
ant colony algorithm/hybrid ant colony algorithm/MapReduce/cloud computing分类
信息技术与安全科学引用本文复制引用
蔡明,左勇安..基于MapReduce的混合蚁群算法研究[J].计算机与现代化,2016,(10):6-9,4.
