| 离散二进制入侵杂草算法 |
| |
| 引用本文： | 张帅,王营冠,夏凌楠.离散二进制入侵杂草算法[J].华中科技大学学报(自然科学版),2011,39(10):55-60. |
| |
| 作者姓名： | 张帅 王营冠 夏凌楠 |
| |
| 作者单位： | 中国科学院上海微系统与信息技术研究所,上海,200050 |
| |
| 基金项目： | 国家科技重大专项资助项目(2010ZX03006-002) |
| |
| 摘 要： | 在继承入侵杂草优化（IWO）算法特性的基础上,提出了一种可用于解决离散空间组合优化问题的二进制入侵杂草优化（BIWO）算法.该算法保留了IWO算法的正态空间扩散特性,设计了一个扩散范围到扩散概率的映射函数,以概率的形式决定二进制杂草比特位的取值.选取连续空间的4个经典函数和离散空间的背包问题,对BIWO算法进行测试,结...
|
| 关 键 词： | 仿生算法 最优化 二进制序列 入侵杂草优化算法 背包问题 |
Invasive weed optimization algorithm of discrete binary version |
| |
| Zhang Shuai Wang Yingguan Xia Lingnan.Invasive weed optimization algorithm of discrete binary version[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2011,39(10):55-60. |
| |
| Authors: | Zhang Shuai Wang Yingguan Xia Lingnan |
| |
| Affiliation: | Zhang Shuai Wang Yingguan Xia Lingnan(Shanghai Institute of Microsystem and Information Technology,Chinese Academy of Sciences,Shanghai 200050,China) |
| |
| Abstract: | On the basis of optimization invasive weed optimization(IWO) algorithm,IWO algorithm of binary version(BIWO) was proposed to solve the discrete combinatorial optimization problems.The method preserved the normal space diffusion feature of IWO algorithm,and designed a mapping function.This function could map the diffusion range into a probability,and the bits of binary weed changed its value according to the probability.Four classical functions in continuous space and the knapsack problems in discrete were u... |
| |
| Keywords: | bionic algorithm optimization binary sequences invasive weed optimization algorithm knapsack problem |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
