ScholarLens Back to search
2013•Journal of Zhejiang Ocean UniversityRequires access

A Summary of Genetic Algorithm on 0/1 Knapsack Problem

Le Tian

Open publisher page 0 citations

Abstract

Knapsack problem is a combinatorial optimization problem,there are many types,such as multidimensional knapsack problem;0/1 knapsack problem discussed in this paper is the most primitive and the most basic knapsack problem.Genetic algorithm(GA) on the knapsack problem has been shown to great advantage.This paper analyzed the main problems of 0/1 knapsack problem using genetic algorithm,summarized and analyzed the related documents for the past six years,pointed out the future research directions,provided a reference for the genetic algorithm for solving 0/1 knapsack problem.

About this research paper

What this paper is about

Knapsack problem is a combinatorial optimization problem,there are many types,such as multidimensional knapsack problem;0/1 knapsack problem discussed in this paper is the most primitive and the most basic knapsack problem.Genetic algorithm(GA) on the knapsack problem has been shown to great advantage.This paper analyzed the main problems of 0/1 knapsack problem using genetic algorithm,summarized and analyzed the related documents for the past six years,pointed out the future research directions,provided a reference for the genetic algorithm for solving 0/1 knapsack problem.

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

Knapsack problem is a combinatorial optimization problem,there are many types,such as multidimensional knapsack problem;0/1 knapsack problem discussed in this paper is the most primitive and the most basic knapsack problem.Genetic algorithm(GA) on the knapsack problem has been shown to great advantage.This paper analyzed the main problems of 0/1 knapsack problem using genetic algorithm,summarized and analyzed the related documents for the past six years,pointed out the future research directions,provided a reference for the genetic algorithm for solving 0/1 knapsack problem.

Key concepts: Knapsack problem, Continuous knapsack problem, Change-making problem, Polynomial-time approximation scheme, Cutting stock problem, Genetic algorithm, Generalized assignment problem, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Summary of Genetic Algorithm on 0/1 Knapsack Problem — Research Paper | ScholarLens