Time Ant Colony Algorithm with Genetic Algorithms
Time ant colony algorithm has good effect on combinatorial optimization problems as well as that of the ant colony algorithm while it has the shortcoming of long convergence time. A new method combined with genetic algorithms is proposed. Firstly a genetic algorithms procedure is used to solve the problem in specifying time. Secondly the solution having gotten is used to distribute the original pheromone. At the last the time ant colony algorithm is used to search the optimal solution, which supposed that each ants velocity is the same and all ants are crawling in full time.The new method accelerates the convergence speed. It is testified by the experiment that the novel algorithm is better than before.
Time ant colony algorithm genetic algorithms traveling salesman problem.
Hong-hao Zuo Fan-lun Xiong
Institute of Intelligent Machines, Chinese Academy of Sciences; Department of Automation, University Institute of Intelligent Machines,Chinese Academy of Sciences P.o. Box 1130, He Fei, An Hui, China
国际会议
2006 IEEE International Conference on Information Acquisition
山东威海
英文
1057-1061
2006-08-20（万方平台首次上网日期，不代表论文的发表时间）