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

A Novel Evolutionary Algorithm for Multidimensional Knapsack Problem

Author

Listed:
  • Sara Sabba

    (Department of Computer Science and Engineering, Constantine University 2, Constantine, Algeria)

  • Salim Chikhi

    (Department of Computer Science and Engineering, Constantine University 2, Constantine, Algeria)

Abstract

Binary optimization problems are in the most case the NP-hard problems that call to satisfy an objective function with or without constraints. Various optimization problems can be formulated in binary expression whither they can be resolved in easier way. Optimization literature supplies a large number of approaches to find solutions to binary hard problems. However, most population-based algorithms have a great tendency to be trapped in local optima particularly when solving complex optimization problems. In this paper, the authors introduce a new efficient population-based technique for binary optimization problems (that we called EABOP). The proposed algorithm can provide an effective search through a new proposed binary mutation operator. The performance of our approach was tested on hard instances of the multidimensional knapsack problem. The obtained results show that the new algorithm is able of quickly obtaining high-quality solutions for most hard instances of the problem.

Suggested Citation

  • Sara Sabba & Salim Chikhi, 2015. "A Novel Evolutionary Algorithm for Multidimensional Knapsack Problem," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 6(2), pages 1-20, April.
  • Handle: RePEc:igg:joris0:v:6:y:2015:i:2:p:1-20
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijoris.2015040101
    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:1-20. 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.