%0 Journal Article
%T Adaptive ant colony optimization algorithms and its convergence<br>一类自适应蚁群算法及其收敛性分析
%A FENG Yuan-jing
%A FENG Zu-ren
%A PENG Qin-ke
%A <br>冯远静
%A 冯祖仁
%A 彭勤科
%J 控制理论与应用
%D 2005
%I 
%X A class of adaptive ant colony optimization(ACO) algorithms is presented to avoid the deficiency of typical ACO that often runs into local optimum.Global searching and convergence abilities are improved by adaptively changing the pheromone trails evaporation parameters.Some convergence properties for the algorithms are analyzed with the Markov process approach.Further more,an algorithm with guaranteed convergence to the optimal solution is developed.The simulation results for typical TSP problems demonstrate that the proposed algorithms are more effective than those for other modified ant systems.
%K ant colony optimization
%K convergence
%K Markov<br>蚁群算法
%K 收敛性
%K 马尔科夫链
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=970898A57DFC021F93AB51667BAED7F7&aid=4BE1CA9D72FF6816&yid=2DD7160C83D0ACED&vid=BC12EA701C895178&iid=94C357A881DFC066&sid=A586B761C9AA2FAA&eid=E5ED9059DE792E50&journal_id=1000-8152&journal_name=控制理论与应用&referenced_num=8&reference_num=9