Discrete invasive weed optimization algorithm for 0/1 knapsack problem

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.