2005Unpublished venueRequires access

Solving the 0-1's knapsack Problem by Genetic Algorithm

Yang Li

Open publisher page 0 citations

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 .

About this research paper

What this paper is about

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 .

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

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

Key concepts: Knapsack problem, Genetic algorithm, Selection (genetic algorithm), Continuous knapsack problem, Algorithm, Realization (probability), Computer science, Genetic representation

Related papers

Back to paper searchBrowse research topicsOriginal source
Solving the 0-1's knapsack Problem by Genetic Algorithm — Research Paper | ScholarLens