文献类型：期刊文献

英文题名：A kind of ant colony algorithm with route evaluation

作者：Zhao, Fang[1]

第一作者：赵芳

通讯作者：Zhao, Fang

机构：[1] Department of Computer and Information Engineering, Xinxiang University, Xinxiang City, China

第一机构：新乡学院计算机与信息工程学院

年份：2014

卷号：6

期号：1

起止页码：699-705

外文期刊名：Open Automation and Control Systems Journal

收录：EI(收录号：20151900830828);Scopus(收录号：2-s2.0-84928886218)

语种：英文

外文关键词：Ant colony optimization - Optimization

摘要：Ant algorithm is a novel meta-heuristic optimization algorithm, but at the same time there are some disadvantages. This paper proposed an ant colony algorithm with route evaluation based on the basic ant colony algorithm. After all ant complete the route search once, the current search situation can be evaluated according to an improved formula of standard deviation, then to decide to update global pheromone or not. At the same time, via the function of interval compression, the pheromone of all routes is compressed to adjust the searching probability of ants to each city. Experimental results show that this improved algorithm has more excellent presentation on convergence, searching optimization, and stability. ? Fang Zhao.