期刊文献+

On the analysis of ant colony optimization for the maximum independent set problem

原文传递
导出
摘要 1 Introduction Inspired by natural evolution and biological behavior,researchers have developed many successful bio-inspired algorithms.Ant colony optimization(ACO)is one of the most successful bio-inspired computing methods for complex optimization problems.In contrast to the wide range of applications,the theoretical understanding of this kind of algorithms lagged far behind[1].Therefore,it is desirable and necessary to improve the theoretical foundation of the algorithm in order to have a better understanding of the execution mechanism of the algorithm and guide the algorithm design.Many researches are devoted to understanding the working principles of bio-inspired algorithms,and try to bridge the gap between theoretical research and practical applications of the algorithms.Many encouraging results have been obtained[2].
出处 《Frontiers of Computer Science》 SCIE EI CSCD 2021年第4期211-213,共3页 中国计算机科学前沿(英文版)
基金 This work was supported by the National Natural Science Foundation of China(Grant Nos.61703183,61773410 and 61876207) the PublicWelfare Technology Application Research Plan of Zhejiang Province(LGG19F030010) the Science and Technology Program of Guangzhou(202002030260).
  • 相关文献

参考文献1

共引文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部