A Review and Comparison of Genetic Algorithms for the 0-1 Multidimensional Knapsack Problem

Bernhard Lienland and Li Zeng
Additional contact information
Bernhard Lienland: University of Regensburg, Regensburg, Germany
Li Zeng: University of Regensburg, Regensburg, Germany

International Journal of Operations Research and Information Systems (IJORIS), 2015, vol. 6, issue 2, 21-31

Abstract: The 0-1 multidimensional knapsack problem (MKP) is a well-known combinatorial optimization problem with several real-life applications, for example, in project selection. Genetic algorithms (GA) are effective heuristics for solving the 0-1 MKP. Multiple individual GAs with specific characteristics have been proposed in literature. However, so far, these approaches have only been partially compared in multiple studies with unequal conditions. Therefore, to identify the “best” genetic algorithm, this article reviews and compares 11 existing GAs. The authors' tests provide detailed information on the GAs themselves as well as their performance. The authors validated fitness values and required computation times in varying problem types and environments. Results demonstrate the superiority of one GA.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 18/ijoris.2015040102 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:joris0:v:6:y:2015:i:2:p:21-31

Access Statistics for this article

International Journal of Operations Research and Information Systems (IJORIS) is currently edited by John Wang

More articles in International Journal of Operations Research and Information Systems (IJORIS) from IGI Global
Bibliographic data for series maintained by Journal Editor ().