IDEAS home Printed from https://ideas.repec.org/a/igg/joris0/v6y2015i2p21-31.html
   My bibliography  Save this article

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

Author

Listed:
  • Bernhard Lienland

    (University of Regensburg, Regensburg, Germany)

  • Li Zeng

    (University of Regensburg, Regensburg, Germany)

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.

Suggested Citation

  • Bernhard Lienland & Li Zeng, 2015. "A Review and Comparison of Genetic Algorithms for the 0-1 Multidimensional Knapsack Problem," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 6(2), pages 21-31, April.
  • Handle: RePEc:igg:joris0:v:6:y:2015:i:2:p:21-31
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijoris.2015040102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:joris0:v:6:y:2015:i:2:p:21-31. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.