计算机工程与应用2012，Vol.48Issue(30)：239-242,248,5.DOI:10.3778/j.issn.1002-8331.2012.30.050
离散杂草优化算法在0/1背包问题中的应用
Discrete invasive weed optimization algorithm for 0/1 knapsack problem
宋晓萍 1胡常安2
作者信息
- 1. 烟台南山学院管理科学与工程学院,山东烟台265713
- 2. 兰州理工大学机电工程学院,兰州730050
- 折叠
摘要
Abstract
To address the issue of restraining premature stagnation problem of particle swarm optimization algorithm for solving 0/1 knapsack problem, a Discrete Invasive Weed Optimization algorithm(DIWO) is designed. Based on the characteristics of combinatorial optimization problem, this paper disperses the distribution of the offspring, an improved mutation operator of the genetic algorithm is applied to the new algorithm, to ensure its effectiveness and the local random search capability. The experimental results show that the algorithm, with the smaller populations and the fewer number of iterations, can produce better results, compared with the particle swarm optimization algorithm for knapsack problem.关键词
杂草优化算法/0/1背包问题/组合优化Key words
invasive weed optimization/ 0/1 knapsack problem/ combinatorial optimization分类
信息技术与安全科学引用本文复制引用
宋晓萍,胡常安..离散杂草优化算法在0/1背包问题中的应用[J].计算机工程与应用,2012,48(30):239-242,248,5.
