An Algorithm Based on Chaotic Genetic Algorithm for 0-1 Knapsack Problem

Dengxu He; Guiqing Liu

doi:10.1109/icbecs.2010.5462446

ScienceGate Book Chapters

JOURNAL ARTICLE

An Algorithm Based on Chaotic Genetic Algorithm for 0-1 Knapsack Problem

Dengxu He Guiqing Liu

Year: 2010 Vol: 26 Pages: 1-3

DOI: 10.1109/icbecs.2010.5462446

Get Full-Text PDF Get Analytical Report

Abstract

Based on Chaotic Genetic Algorithm idea, this paper presents a new solution for the classic Knapsack Problem(KP). We introduce Chaos idea into Genetic Algorithm, adding the disturbance to help finding better solutions in the traditional Genetic Algorithm. Results of numerical tests show that it has high efficiency and the good ability of global optimization.

Keywords:

Knapsack problem Continuous knapsack problem Algorithm Genetic algorithm Chaotic CHAOS (operating system) Computer science Polynomial-time approximation scheme Mathematical optimization Mathematics Artificial intelligence

Metrics

Cited By

0.40

FWCI (Field Weighted Citation Impact)

Refs

0.70

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Metaheuristic Optimization Algorithms Research

Physical Sciences → Computer Science → Artificial Intelligence

Advanced Manufacturing and Logistics Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

An Algorithm Based on Chaotic Genetic Algorithm for 0-1 Knapsack Problem

Abstract

Metrics

Topics

Related Documents

Quantum Walk based genetic algorithm for 0–1 quadratic knapsack problem

0-1 Knapsack Problem Solving using Genetic Optimization Algorithm

Knowledge-based Genetic Algorithm for the 0–1 Multidimensional Knapsack Problem

0/1 Knapsack Problem using Diversity based Dual Population Genetic Algorithm

0-1 Knapsack Problem Solving using Genetic Optimization Algorithm