A genetic algorithm to solve the multidimensional Knapsack problem
Küçük Resim Yok
Tarih
2013
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Ö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.
Açıklama
Anahtar Kelimeler
Evolutionary algorithms, Genetic algorithm, Heuristic approach, Multidimensional Knapsack problem
Kaynak
Mathematical and Computational Applications
WoS Q Değeri
Scopus Q Değeri
N/A
Cilt
18
Sayı
3
