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

Hybridizing Artificial Bee Colony Algorithm with Multi-Parent Crossover Operator

Author

Listed:
  • Amal Mahmoud Abunaser

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

  • Sawsan Alshattnawi

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

Abstract

Artificial Bee Colony algorithm (ABC) is a new optimization algorithms used to solve several optimization problems. The algorithm is a swarm-based that simulates the intelligent behavior of honey bee swarm in searching for food sources. Several variations of ABC have been three existing solution vectors, the new solution vectors will replace the worst three vectors in the food source proposed to enhance its performance. This paper proposes a new variation of ABC that uses multi-parent crossover named multi parent crossover operator artificial bee colony (MPCO-ABC). In the proposed technique the crossover operator is used to generate three new parents based on memory (FSM). The proposed algorithm has been tested using a set of benchmark functions. The experimental results of the MPCO-ABC are compared with the original ABC, GABC. The results prove the efficiency of MPCO-ABC over ABC. Another comparison of MPCO-ABC results made with the other variants of ABC that use crossover and/or mutation operator. The MPCO-ABC almost always shows superiority on all test functions.

Suggested Citation

  • Amal Mahmoud Abunaser & Sawsan Alshattnawi, 2015. "Hybridizing Artificial Bee Colony Algorithm with Multi-Parent Crossover Operator," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 6(2), pages 18-32, April.
  • Handle: RePEc:igg:jamc00:v:6:y:2015:i:2:p:18-32
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.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:jamc00:v:6:y:2015:i:2:p:18-32. 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.