A genetic algorithm to solve the multidimensional Knapsack problem

Creative Commons License

BERBERLER M. E., Guler A., NURİYEV U.

Mathematical and Computational Applications, cilt.18, sa.3, ss.486-494, 2013 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 18 Sayı: 3
  • Basım Tarihi: 2013
  • Doi Numarası: 10.3390/mca18030486
  • Dergi Adı: Mathematical and Computational Applications
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, TR DİZİN (ULAKBİM)
  • Sayfa Sayıları: ss.486-494
  • Anahtar Kelimeler: Evolutionary algorithms, Genetic algorithm, Heuristic approach, Multidimensional Knapsack problem
  • Dokuz Eylül Üniversitesi Adresli: Evet

Ö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.