2009•Unpublished venueRequires access

Solve Zero-One Knapsack Problem by Greedy Genetic Algorithm

Yuxiang Shao, Hongwen Xu, Weiming Yin

Abstract

In order to overcome the disadvantages of the traditional genetic algorithm and improve the speed and precision of the algorithm, the author improved the selection strategy, integrated the greedy algorithm with the genetic algorithm and formed the greedy genetic algorithm. The paper discussed the basic idea and method to solve the zero-one knapsack problem using this greedy genetic algorithm. The experiments prove the feasibility and validity of the algorithm.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 7 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

Key concepts: Knapsack problem, Greedy algorithm, Continuous knapsack problem, Genetic algorithm, Algorithm, Greedy randomized adaptive search procedure, Mathematical optimization, Selection (genetic algorithm)