ScholarLens Back to search
2018•International Journal of Advanced Technology and Engineering ExplorationOpen access

Applying greedy genetic algorithm on 0/1 multiple knapsack problem

Vinod Jain, Jay Shankar Prasad

Open full text 0 citations

Abstract

Umbarkar et al. [1] propose a genetic algorithm with the dual population to solve optimization problems.The application of dual population improves the performance of the genetic algorithm for solving these problems.It basically removes the problem of Research

Open-access reader

About this research paper

What this paper is about

Umbarkar et al. [1] propose a genetic algorithm with the dual population to solve optimization problems.The application of dual population improves the performance of the genetic algorithm for solving these problems.It basically removes the problem of Research

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

Umbarkar et al. [1] propose a genetic algorithm with the dual population to solve optimization problems.The application of dual population improves the performance of the genetic algorithm for solving these problems.It basically removes the problem of Research

Key concepts: Knapsack problem, Continuous knapsack problem, Greedy algorithm, Genetic algorithm, Computer science, Mathematical optimization, Algorithm, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Applying greedy genetic algorithm on 0/1 multiple knapsack problem — Research Paper | ScholarLens