计算机科学 ›› 2011, Vol. 38 ›› Issue (3): 20-23.
• 综述 • 上一篇 下一篇
韩毅,蔡建湖,李延来,周根贵
出版日期:
发布日期:
基金资助:
HAN Yi,CAI Jian-hu,LI Yan-lai,ZHOU Gen-gui
Online:
Published:
摘要: 野草算法(Invasive Weed Optimization, IWO)是近年来提出的一种简单、有效的基于种群的新颖数值优化算法,自其提出以来正逐渐受到国内外学术界和工程优化领域的关注。IWO算法的提出是受到具有侵略和殖民特性的野草的启发。由于野草在殖民化过程中体现出较强的鲁棒性、自适应性和随机性,因此IWO算法的执行框架尽量模仿野草的殖民化进程。详细阐述了IWO算法的基本原理和流程,总结了其在优化和工程技术领域中的最新研究进展。
关键词: 野草算法,工程优化,殖民化,鲁棒性
Abstract: Invasive Weed Optimization(IWO) is a recently proposed simple and effective population-based novel numerical optimization algorithm. It's receiving increasing focuses from academic and engineering optimization fields. IWO is inspired from the invasive and colonizing characteristics of weeds, which tries to imitate the robustness, adaptation and randomness embodied by weeds during the colonizing process. Here,the fundamental principles and framework of IWO were described in detail. Then, the advances of IWO in the current optimization and engineering fields were summed up.
Key words: Invasive weed optimization, Engineering optimization, Colonization, Robustness
韩毅,蔡建湖,李延来,周根贵. 野草算法及其研究进展[J]. 计算机科学, 2011, 38(3): 20-23. https://doi.org/
HAN Yi,CAI Jian-hu,LI Yan-lai,ZHOU Gen-gui. Invasive Weed Optimization and its Advances[J]. Computer Science, 2011, 38(3): 20-23. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2011/V38/I3/20
Cited