IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/8440165.html
   My bibliography  Save this article

A Hybrid Harmony Search Algorithm with Distribution Estimation for Solving the 0-1 Knapsack Problem

Author

Listed:
  • Kang Liu
  • Haibin Ouyang
  • Steven Li
  • Liqun Gao
  • Rohit Salgotra

Abstract

Many optimization algorithms have been applied to solve high-dimensional instances of the 0-1 knapsack problem. However, these algorithms often fall into a local optimization trap and thus fail to obtain the global optimal solutions. To circumvent this shortcoming, a hybrid harmony search algorithm with distribution estimation is proposed in this paper. A few important features of the proposed algorithm are as follows: (i) the idea of probability distribution estimation is employed to design the adaptive search strategy, (ii) a fixed improvisation process is presented to improve the algorithm searching ability, (iii) a new method of initialization is used to ensure that the initialization is feasible harmony and (iv) an improved remediation approach is proposed to effectively repair the infeasible solutions. To assess the effectiveness of the proposed algorithm, some experiments are carried out. The experimental results reveal that the proposed algorithm is a reliable and promising alternative for solving the 0-1 knapsack problem.

Suggested Citation

  • Kang Liu & Haibin Ouyang & Steven Li & Liqun Gao & Rohit Salgotra, 2022. "A Hybrid Harmony Search Algorithm with Distribution Estimation for Solving the 0-1 Knapsack Problem," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-29, May.
    • Handle: RePEc:hin:jnlmpe:8440165
    DOI: 10.1155/2022/8440165
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/8440165.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/mpe/2022/8440165.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2022/8440165?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:hin:jnlmpe:8440165. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.