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: 2018-07-30
Authors : Vinod Jain; Jay Shankar Prasad;
Page : 292-296
Keywords : Multiple knapsack problem; Genetic algorithm; Greedy approach.;
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.
Other Latest Articles
- An integrated optimized hybrid intensity modeled brain tumor image segmentation using artificial bee colony algorithm
- Comparative analysis of high average-utility patterns algorithms
- Effect of partial replacement of cement by ground granulated blast furnace slag and sand by iron ore tailings on properties of concrete
- Contact stress analysis of steel and composite spur gear pairs
- Experimental study on strength properties of concrete replacing cement by marble dust and sand by iron ore tailings
Last modified: 2018-11-04 18:09:46