Application of Ant Colony Algorithm to Maze Problem

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.