A Time Slice Ant Colony Algorithm and Its Application in Chinese Traveling Salesman Problems
Basic ant colony algorithm often meets local optimum solution when used to solve the problem in large solution space.A novel time slice ant colony algorithm,which regresses to the base of ant colony algorithm is put forward and and its proof of convergence is given.It is supposed that each ants velocity is the same and all ants are crawling in each time slice.Ants communicate with others by the pheromone that is left on the road.When an ant finishes its journey,the known optimal route is saved.After some time the ants trail will be on the optimal route between the food and the nest.The experiment of Chinese traveling salesman problem proved the validity of this novel algorithm.The novel algorithm is as well as other ant colony algorithm and has less parameter than before.
ant colony algorithm time slice traveling salesman problem
Zuo Hong-hao
Department of 503 Electronic Engineering Institute Hefei,China
国际会议
重庆
英文
1157-1160
2016-03-20（万方平台首次上网日期，不代表论文的发表时间）