首页 | 本学科首页   官方微博 | 高级检索  
     

蚁群混沌混合优化算法
引用本文:修春波,张宇河.蚁群混沌混合优化算法[J].计算机工程与应用,2006,42(21):43-44,98.
作者姓名:修春波  张宇河
作者单位:1. 天津工业大学自动化系,天津,300160;北京理工大学自动控制系,北京,100081
2. 北京理工大学自动控制系,北京,100081
摘    要:为了克服混沌搜索的盲目性,提出了一种蚁群算法和混沌优化算法相结合的混合优化算法,该算法利用蚁群算法中信息素正反馈的思想指导当前混沌搜索的区域。工作蚁群按照信息素的浓度高低,分别按照不同的概率搜索不同的搜索区域,从而可减少混沌盲目搜索的次数。仿真结果表明,该方法能够明显提高混沌优化算法的寻优效率,同时算法的通用性将有所提高。另外,对于含有多个全局最优解的函数,在一次寻优过程中,该算法可以找到全部最优解,这是通常混沌搜索算法所不具备的。

关 键 词:混沌  蚁群  优化  信息素
文章编号:1002-8331-(2006)21-0043-02
收稿时间:2005-12-01
修稿时间:2005-12-01

Ant Colony Chaos Optimization Algorithm
Xiu Chunbo,Zhang Yuhe.Ant Colony Chaos Optimization Algorithm[J].Computer Engineering and Applications,2006,42(21):43-44,98.
Authors:Xiu Chunbo  Zhang Yuhe
Affiliation:1 Department of Automatic Control,Tianjin Polytechnic University,Tianjin 300160;2 Department of Automatic Control,Beijing Institute of Technology,Beijing 100081
Abstract:A hybrid optimization algorithm based on ant colony algorithms and chaos optimization algorithm is proposed to avoid searching blindly before reducing the searching space of variable optimized in chaos optimization algorithm. The algorithm utilizes the pheromone positive feedback effect to guide chaos search,The working ant colony search different searching space according to the concentration of the pheromone to reduce the searching blindly.The simulation results prove that the efficiency of the algorithm is higher than that of common ones,the regularity of the algorithm could be improved,and the algorithm could search all of global optimal solutions,which could not be realized by common ones.
Keywords:chaos  ant colony  optimization  pheromone
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号