%0 Journal Article
%T Ant colony algorithm based on pheromone intensity<br>基于信息素强度的蚁群算法
%A YANG Jie
%A YANG Sheng
%A ZENG Qing-guang
%A LI Ren-fa
%A <br>杨洁
%A 杨胜
%A 曾庆光
%A 李仁发
%J 计算机应用
%D 2009
%I 
%X When selecting the path, all the existing ant colony algorithms take account of the information of pheromone and distance. In order to simulate the real ant better, this paper proposed a new ant colony algorithm based on the intensity of pheromone, which only depended on the intensity of pheromone when selecting the path. The path length (or distance) was used when initializing and updating the pheromone. A strategy of dynamic pheromone update was given. The experiments demonstrate that the proposed algorithm can obtain good searching results, and the speed of operation is more than five times faster than the existing ant colony algorithms.
%K Ant Colony Optimization (ACO)
%K intensity of pheromone
%K dynamic pheromone updating
%K Traveling Salesman Problem (TSP)<br>蚁群算法
%K 信息素强度
%K 动态信息素更新
%K 旅行商问题
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=374D4547C21DB795A0D2D1A1F601DE76&yid=DE12191FBD62783C&vid=771469D9D58C34FF&iid=38B194292C032A66&sid=461E94ABCF58C63F&eid=65A51D0EBEB846F5&journal_id=1001-9081&journal_name=计算机应用&referenced_num=1&reference_num=18