TY - JOUR A1 - Lienland, Bernhard A1 - Zeng, Li T1 - A Review and Comparison of Genetic Algorithms for the 0-1 Multidimensional Knapsack Problem JF - International Journal of Operations Research and Information Systems (IJORIS) N2 - 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. Y1 - 2015 U6 - https://doi.org/10.4018/ijoris.2015040102 SN - 1947-9328 VL - 6 IS - 2 PB - IGI Global ER -