A Genetic Algorithm to Solve the Multidimensional Knapsack Problem
Makaleler > Tam Makale · 2013
Yazarlar: Murat Berberler, Asli Guler, Urfat NURİYEV
Mathematical and Computational Applications, Uluslararası, Scopus, 2013, cilt 18, ss 486-494
DOI: 10.3390/mca18030486
Özet
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.