Title of article
A GENETIC ALGORITHM TO SOLVE THE MULTIDIMENSIONAL KNAPSACK PROBLEM
Author/Authors
Berberler, Murat Ersen Dokuz Eylul University - Department of Computer Science, Turkey , Guler, Asli Yasar University - Department of Mathematics, Turkey , Nurıyev, Urfat G. Ege University - Department of Mathematics, Turkey
From page
486
To page
494
Abstract
In this paper, The Multidimensional Knapsack Problem (MKP) which occurs in many different applications is studied and a genetic algorithm to solve the MKP is proposed. Unlike the technique of the classical genetic algorithm, initial population is not randomly generated in the proposed algorithm, thus the solution space is scanned more efficiently. Moreover, the algorithm is written in C programming language and is tested on randomly generated instances. It is seen that the algorithm yields optimal solutions for all instances.
Keywords
Multidimensional Knapsack Problem , Genetic Algorithm , Heuristic Approach , Evolutionary Algorithms
Journal title
mathematical and computational applications
Journal title
mathematical and computational applications
Record number
2681412
Link To Document