计算机与数字工程2011，Vol.39Issue(9)：1-2,150,3.
基于RBF的蚁群算法在求解TSP中的应用
Application of Ant Colony Algorithm Based on RBF for Solving Traveling Salesman Problem
摘要
Abstract
To overcome the shortcomings of precocity and stagnation in classical ant colony algorithm* a modified ant colony algorithm is presented. This method based on radial basis function selects some ants and updates the pheromone on their path, and then picks out the worst ant to update. The computer simulation results show that the proposed algorithm improves greatly on the ability of searching for approximate global optimal solution and the convergence speed for solving traveling salesman problem.关键词
旅行商问题/蚁群算法/径向基函数Key words
TSP/ant colony algorithm(ACA)/radial basis function(RBF)分类
信息技术与安全科学引用本文复制引用
吴磊,胡小娴..基于RBF的蚁群算法在求解TSP中的应用[J].计算机与数字工程,2011,39(9):1-2,150,3.基金项目
国家大学生创新性实验计划(编号:101035727)资助. （编号:101035727）
