IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v4y2013i3p1-14.html
   My bibliography  Save this article

Hybridizing Harmony Search Algorithm with Multi-Parent Crossover to Solve Real World Optimization Problems

Author

Listed:
  • Iyad Abu Doush

    (Computer Science Department, Yarmouk University, Irbid, Jordan)

  • Faisal Alkhateeb

    (Computer Science Department, Yarmouk University, Irbid, Jordan)

  • Eslam Al Maghayreh

    (Computer Science Department, Yarmouk University, Irbid, Jordan)

  • Mohammed Azmi Al-Betar

    (Department of Information Technology, Al-Huson University College, Al-Balqa Applied University, Irbid, Jordan)

  • Basima Hani F. Hasan

    (Computer Science Department, Yarmouk University, Irbid, Jordan)

Abstract

Harmony search algorithm (HSA) is a recent evolutionary algorithm used to solve several optimization problems. The algorithm mimics the improvisation behaviour of a group of musicians to find a good harmony. Several variations of HSA have been proposed to enhance its performance. In this paper, a new variation of HSA that uses multi-parent crossover is proposed (HSA-MPC). In this technique three harmonies are used to generate three new harmonies that will replace the worst three solution vectors in the harmony memory (HM). The algorithm has been applied to solve a set of eight real world numerical optimization problems (1-8) introduced for IEEE-CEC2011 evolutionary algorithm competition. The experimental results of the proposed algorithm are compared with the original HSA, and two variations of HSA: global best HSA and tournament HSA. The HSA-MPC almost always shows superiority on all test problems.

Suggested Citation

  • Iyad Abu Doush & Faisal Alkhateeb & Eslam Al Maghayreh & Mohammed Azmi Al-Betar & Basima Hani F. Hasan, 2013. "Hybridizing Harmony Search Algorithm with Multi-Parent Crossover to Solve Real World Optimization Problems," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 4(3), pages 1-14, July.
    • Handle: RePEc:igg:jamc00:v:4:y:2013:i:3:p:1-14
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2013070101
    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:jamc00:v:4:y:2013:i:3:p:1-14. 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.