关键词: 蚁群算法, 混合蚁群算法, MapReduce, 云计算

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.

Key words: ant colony algorithm, hybrid ant colony algorithm, MapReduce, cloud computing