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

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 t...

Full description

Saved in:
Bibliographic Details
Published in2009 Third International Conference on Genetic and Evolutionary Computing pp. 105 - 107
Main Authors JiangFei Zhao, TingLei Huang, Fei Pang, YuanJie Liu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2009
Subjects
0-1 Knapsack Problem
Algorithm design and analysis
Electric variables control
genetic algorithm
Genetic algorithms
Greedy algorithms
Greedy strategy
Mathematical model
Mathematical programming
NP-hard problem
Packaging
Online AccessGet full text

Cover

More Information
Summary: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. In this paper, based on 0-1 knapsack problem is given a mathematical model, and analysis of the greedy strategy .we give agenetic algorithm to solve the knapsack problem. Greedy strategy combining the traditional genetic algorithm has been improved and shortened the time to solve, and to improve the accuracy of the solution.
ISBN:9781424452453
1424452457
9780769538990
0769538991
DOI:10.1109/WGEC.2009.43