摘要
本文重点讨论了蚁群算法,包括蚁群算法的基本原理及工作流程.为了模拟实际蚂蚁的觅食行为,设人工蚁出发点H为蚁穴位置,食物源则在最终目标点F,蚂蚁觅食过程就是从H出发,在AS范围寻找食物源的过程.经过蚂蚁群体的反复寻食,基于蚂蚁留下信息素的正反馈作用,最终绕开所有障碍物找到了一条最短路径.
In this paper,the ant colony optimization,namely the basic principle and workflow of the ant colony optimization is mainly discussed.In the end,to simulate the ant defacto foraging,the anthill and food source are denoted by starting point H of the robot and the object point F,respectively.The process of the ant foraging is the procedure that the ant begins with H and finds the food source within AS from T,by the iterative foraging of the ant colony and based on positive feedback effect of the pheromone which the ants leave,finally a shortest path is find by bypassing all obstacles.
出处
《内蒙古民族大学学报（自然科学版）》
2011年第4期402-404,共3页
Journal of Inner Mongolia Minzu University：Natural Sciences
关键词
蚁群算法
信息素
最短路径
Ant Colony Optimization
Feedback
Shortest Path
