%0 Journal Article
%T Ant colony algorithm based on new pheromone updated strategy<br>基于新型信息素更新策略的蚁群算法*
%A CEN Yu-sen
%A XIONG Fang-min
%A ZENG Bi-qing
%A <br>岑宇森
%A 熊芳敏
%A 曾碧卿
%J 计算机应用研究
%D 2010
%I 
%X This paper studied the routes searching strategy and the pheromone updating strategy of ant colony optimization algorithm (ACO) and ananlyzed the limitations of these strategies. To increase the performance of ACO, proposed the ant colony system based on improved pheromone updated strategy (PACS). Gave an example of traveling salesman problem, which was simulated by using basic ACO and PACS. The simulation results show that PACS has excellent global optimization properties and faster convergence speed, and it can avoid premature convergence of ACO.
%K ant colony optimization
%K traveling salesman problem
%K parameters control
%K pheromone<br>蚁群算法
%K 旅行商销售问题
%K 参数控制
%K 信息素
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=8EDB9358E4408A125A9E88C79B0198F4&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=B31275AF3241DB2D&sid=C50D3A5A67C234D1&eid=3ACF23F338F5D241&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=10