摘要
该文将蚁群算法应用于迷宫最优路径问题。针对迷宫最优路径问题的特点,将蚁群分成两组,分别从迷宫的起点和终点出发,每只蚂蚁按迷宫的行走规则向前移动。对移动的蚂蚁定义了三种生命周期,只有满足特定行为的蚂蚁所走过的路径才能构成迷宫问题的可行解。对不同规模迷宫问题的实验结果显示,该算法是一种求解迷宫最优路径问题的有效算法。
Ant colony algorithm is applied to maze problem in this paper. First, the ant colony is divided into two sub-colonies, the ants of one sub-colony get out from start point of maze and the other from end point of maze. Each ant move s on the maze by the moving rule of maze problem. Three lifetimes are defined fo r the moving ants and only the ones satisfying some conditions can generat e a feasible solution of maze problem. The experimental results show that the al gorithm is effective for maze problem.
出处
《计算机仿真》
CSCD
2005年第4期114-116,161,共4页
Computer Simulation
关键词
蚁群算法
迷宫问题
最优路径
Ant colony algorithm
Maze problem
Optimal path
