ScholarLens Back to search
2003•Journal of Tianjin Normal UniversityRequires access

The Genetic Algorithm of Solving 0-1's Knapsack Problem and Its Improvement

Yang Liu

Open publisher page 1 citations

Abstract

The genetic algorithm is a search algorithm based on natural selection and genetic mechanism. The classical genetic algorithm was improved by use of combinating singlepointcrossover with multipointcrossover and classical algorithm with genetic algorithm. The famous 0-1's knapsack problem was discussed with genetic algorithm, and a better approximate solution was obtained in experiment.

About this research paper

What this paper is about

The genetic algorithm is a search algorithm based on natural selection and genetic mechanism. The classical genetic algorithm was improved by use of combinating singlepointcrossover with multipointcrossover and classical algorithm with genetic algorithm. The famous 0-1's knapsack problem was discussed with genetic algorithm, and a better approximate solution was obtained in experiment.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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 based on natural selection and genetic mechanism. The classical genetic algorithm was improved by use of combinating singlepointcrossover with multipointcrossover and classical algorithm with genetic algorithm. The famous 0-1's knapsack problem was discussed with genetic algorithm, and a better approximate solution was obtained in experiment.

Key concepts: Knapsack problem, Crossover, Genetic algorithm, Selection (genetic algorithm), Continuous knapsack problem, Genetic representation, Population-based incremental learning, Mathematical optimization

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The Genetic Algorithm of Solving 0-1's Knapsack Problem and Its Improvement — Research Paper | ScholarLens