High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Hybridization in Genetic Algorithm with Hill Climbing to Optimize the Knapsack Problem

Author(s):

Amita Sharma , Doon Valley Institute of Engineering & Technology, Karnal (Haryana); Kiran Jain, Doon Valley Institute of Engineering & Technology, Karnal (Haryana)

Keywords:

Hill Climbing, Knapsack Problem

Abstract

Genetic Algorithm (GA) is used to solve optimization problems. Knapsack is an optimization problem. To solve the knapsack problem we used two algorithms and their results were compared. To solve the knapsack problem we use genetic algorithm operators as selection, crossover, and mutation after that we perform the hybridization of GA and the results of both algorithms were compared. Memetic algorithm is combination of genetic algorithm and hill climbing on the Knapsack problem to obtain the more optimized result.

Other Details

Paper ID: IJSRDV3I40438
Published in: Volume : 3, Issue : 4
Publication Date: 01/07/2015
Page(s): 1112-1115

Article Preview

Download Article