Welcome to the InfoSci Platform
Reference Hub6
A Review and Comparison of Genetic Algorithms for the 0-1 Multidimensional Knapsack Problem

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

Bernhard Lienland, Li Zeng
Copyright: © 2015 |Volume: 6 |Issue: 2 |Pages: 11
ISSN: 1947-9328|EISSN: 1947-9336|EISBN13: 9781466678002|DOI: 10.4018/ijoris.2015040102
Cite Article Cite Article

MLA

Lienland, Bernhard, and Li Zeng. "A Review and Comparison of Genetic Algorithms for the 0-1 Multidimensional Knapsack Problem." IJORIS vol.6, no.2 2015: pp.21-31. http://doi.org/10.4018/ijoris.2015040102

APA

Lienland, B. & Zeng, L. (2015). A Review and Comparison of Genetic Algorithms for the 0-1 Multidimensional Knapsack Problem. International Journal of Operations Research and Information Systems (IJORIS), 6(2), 21-31. http://doi.org/10.4018/ijoris.2015040102

Chicago

Lienland, Bernhard, and Li Zeng. "A Review and Comparison of Genetic Algorithms for the 0-1 Multidimensional Knapsack Problem," International Journal of Operations Research and Information Systems (IJORIS) 6, no.2: 21-31. http://doi.org/10.4018/ijoris.2015040102

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.