IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v252y2015icp503-519.html
   My bibliography  Save this article

Adaptive pair bonds in genetic algorithm: An application to real-parameter optimization

Author

Listed:
  • Lim, Ting Yee
  • Al-Betar, Mohammed Azmi
  • Khader, Ahamad Tajudin

Abstract

Genetic algorithm (GA) is a heuristic search technique that draws inspiration from principles and mechanisms of natural selection. Conventionally, parents selection takes place at every generation and offspring are reproduced through genetic operators like crossover and mutation. The process reiterates until some termination conditions are met. Until recently, little attention has been paid on the enduring relationship between parent solutions. In this paper, we take on and further extend the idea of monogamous genetic algorithm to solving real-coded numerical optimization problems. In this GA model, each monogamous pair of parents yields two offspring, and only the best two offspring survive into the next generation. Occasional infidelity generates variety and promotes diversity in the population. Simulation results over the IEEE-CEC’13 (IEEE Congress on Evolutionary Computation 2013) contest for real parameter single objective optimization with 28 benchmark functions demonstrate the effectiveness of the proposed approach.

Suggested Citation

  • Lim, Ting Yee & Al-Betar, Mohammed Azmi & Khader, Ahamad Tajudin, 2015. "Adaptive pair bonds in genetic algorithm: An application to real-parameter optimization," Applied Mathematics and Computation, Elsevier, vol. 252(C), pages 503-519.
    • Handle: RePEc:eee:apmaco:v:252:y:2015:i:c:p:503-519
    DOI: 10.1016/j.amc.2014.12.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300314016841
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2014.12.030?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:apmaco:v:252:y:2015:i:c:p:503-519. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.