ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Applying greedy genetic algorithm on 0/1 multiple knapsack problem

Journal: International Journal of Advanced Technology and Engineering Exploration (IJATEE) (Vol.5, No. 45)

Publication Date:

Authors : ; ;

Page : 292-296

Keywords : Multiple knapsack problem; Genetic algorithm; Greedy approach.;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

Knapsack problem is a well-known optimization problem in computer science. It has many application areas in science and engineering. Knapsack problem can be solved using genetic algorithm. Multiple knapsack problem (MKP) is a special form of knapsack problem in which items are to be placed in more than one knapsack. Many researchers solve MKP problem using different techniques such as ant colony optimization (ACO), particle swarm optimization (PSO) and genetic algorithm (GA). The objective of this paper is to solve MKP problem using GA in an efficient manner. In this paper MKP is solved using greedy genetic algorithm. The proposed genetic algorithm uses greedy approach in its selection and reproduction operations of GA. The proposed greedy genetic algorithm is implemented on a standard data set and results ensure that the proposed greedy algorithm performs better than the standard genetic algorithm.

Last modified: 2018-11-04 18:09:46