Solving the 0-1's knapsack Problem by Genetic Algorithm
Yang Li
Abstract
Yang Li
Abstract
The genetic algorithm is a search algorithm on natural selection and genetic mechanism.The famous 0-1`s knapsack problem is a example that is used to describe the thought and process of the realization of the genetic algorithm in this paper.It will make more readers know the genetic algorithm .
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The genetic algorithm is a search algorithm on natural selection and genetic mechanism.The famous 0-1`s knapsack problem is a example that is used to describe the thought and process of the realization of the genetic algorithm in this paper.It will make more readers know the genetic algorithm .
Key concepts: Knapsack problem, Genetic algorithm, Selection (genetic algorithm), Continuous knapsack problem, Algorithm, Realization (probability), Computer science, Genetic representation