Genetic Algorithm Based on Greedy Strategy in the 0-1 Knapsack Problem

  • Authors:

  • JiangFei Zhao;TingLei Huang;Fei Pang;YuanJie Liu

  • Affiliations:

  • -;-;-;-

  • Venue:
  • WGEC '09 Proceedings of the 2009 Third International Conference on Genetic and Evolutionary Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

0-1 knapsack problem is a typical NP complex issues in field of computer. Traditional solve knapsack problem is recursively backtracking and greedy methods. Use recursive backtracking to solve knapsack problem algorithm of the advantages of thinking is that it simple and it can completely traverse the search space, sure to find the optimal solution but the solution space is exponential growth, when the large to a certain extent, with This algorithm will solve the knapsack problem is unrealistic. The greedy algorithm can only be obtained Approximate solve in a certain range near the optimal solution