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

Local Search Strategy Embedded ABC and Its Application in Cost Optimization Model of Project Time Schedule

Author

Listed:
  • Tarun K. Sharma

    (Amity University Rajasthan, Jaipur, India)

  • Jitendra Rajpurohit

    (Symbiosis International University, India)

Abstract

This article describes how artificial bee colony (ABC) is a promising metaheuristic algorithm, modeled on the intelligent forging behavior of honey bees. ABC takes its inspiration from natural honey bees. In ABC the colony of bees is generally alienated into three groups namely scout, employed and onlooker bees that participates in getting optimal food sources (solutions). With an edge over similar metaheuristic algorithms in solving optimization problems ABC suffers with bad exploitation (local search) capability, however excels in exploration (global search) capability. In order to balance both the aforesaid capabilities, this article embeds the local search strategy in the basic structure of ABC. The proposed scheme is named as LS-ABC. The efficiency of the proposed scheme has been tested and simulated results are compared with state-of-art algorithms over 12 benchmark functions. Also, LS-ABC has been validated to solve cost optimization model of project time schedule. The simulated results are compared with state-of-art algorithms.

Suggested Citation

  • Tarun K. Sharma & Jitendra Rajpurohit, 2019. "Local Search Strategy Embedded ABC and Its Application in Cost Optimization Model of Project Time Schedule," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 10(1), pages 92-106, January.
  • Handle: RePEc:igg:jamc00:v:10:y:2019:i:1:p:92-106
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2019010106
    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:10:y:2019:i:1:p:92-106. 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.