Applying greedy genetic algorithm on 0/1 multiple knapsack problem

Vinod Jain; Jay Shankar Prasad

doi:10.19101/ijatee.2018.545018

ScienceGate Book Chapters

JOURNAL ARTICLE

Applying greedy genetic algorithm on 0/1 multiple knapsack problem

Vinod Jain Jay Shankar Prasad

Year: 2018 Journal: International Journal of Advanced Technology and Engineering Exploration Vol: 5 (45)Pages: 292-296

DOI: 10.19101/ijatee.2018.545018

Get Full-Text PDF Get Analytical Report

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

Keywords:

Knapsack problem Continuous knapsack problem Greedy algorithm Genetic algorithm Computer science Mathematical optimization Algorithm Mathematics

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.12

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Optimization and Packing Problems

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Advanced Manufacturing and Logistics Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Robotic Path Planning Algorithms

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Applying greedy genetic algorithm on 0/1 multiple knapsack problem

Abstract

Metrics

Topics

Related Documents

Genetic Algorithm Based on Greedy Strategy in the 0-1 Knapsack Problem

A Hybrid Genetic Algorithm for the 0–1 Multiple Knapsack Problem

Greedy Approach for Optimizing 0-1 Knapsack Problem

0-1 Knapsack Problem Solving using Genetic Optimization Algorithm

0-1 Knapsack Problem Solving using Genetic Optimization Algorithm