Solving Unbounded Knapsack Problem Using an Adaptive Genetic Algorithm with Elitism Strategy

2007 ◽  
pp. 193-202 ◽  
Author(s):  
Rung-Ching Chen ◽  
Cheng-Huei Jian
Keyword(s):  
Genetic Algorithm ◽  
Knapsack Problem ◽  
Adaptive Genetic Algorithm

Solving the 0/1 knapsack problem using an adaptive genetic algorithm

2002 ◽  
Vol 16 (1) ◽  
pp. 23-30 ◽  
Author(s):  
ZOHEIR EZZIANE
Keyword(s):  
Genetic Algorithm ◽  
Knapsack Problem ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Adaptive Genetic Algorithm ◽  
Stochastic Algorithms ◽  
Initial Population ◽  
Genetic Operators ◽  
Adaptive Penalty ◽  
Genetic Algorithm Approach

Probabilistic and stochastic algorithms have been used to solve many hard optimization problems since they can provide solutions to problems where often standard algorithms have failed. These algorithms basically search through a space of potential solutions using randomness as a major factor to make decisions. In this research, the knapsack problem (optimization problem) is solved using a genetic algorithm approach. Subsequently, comparisons are made with a greedy method and a heuristic algorithm. The knapsack problem is recognized to be NP-hard. Genetic algorithms are among search procedures based on natural selection and natural genetics. They randomly create an initial population of individuals. Then, they use genetic operators to yield new offspring. In this research, a genetic algorithm is used to solve the 0/1 knapsack problem. Special consideration is given to the penalty function where constant and self-adaptive penalty functions are adopted.

Recycling Lethal Chromosomes Based on Immune Operation in Genetic Algorithm for Multi-Knapsack Problem

2014 ◽  
Vol 1 ◽  
pp. 219-222
Author(s):  
Jing Guo ◽  
Jousuke Kuroiwa ◽  
Hisakazu Ogura ◽  
Izumi Suwa ◽  
Haruhiko Shirai ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Knapsack Problem
Sign in / Sign up

Export Citation Format

Share Document