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

Centroid Opposition-Based Differential Evolution

Author

Listed:
  • Shahryar Rahnamayan

    (Electrical, Computer, and Software Engineering Department, University of Ontario Institute of Technology, Oshawa, Ontario, Canada)

  • Jude Jesuthasan

    (Electrical and Computer Engineering Department, University of Waterloo, Waterloo, Ontario, Canada)

  • Farid Bourennani

    (Electrical, Computer, and Software Engineering Department, University of Ontario Institute of Technology, Oshawa, Ontario, Canada)

  • Greg F. Naterer

    (Faculty of Engineering and Applied Science, Memorial University of Newfoundland, St. John's, Canada)

  • Hojjat Salehinejad

    (Electrical, Computer, and Software Engineering Department, University of Ontario Institute of Technology, Oshawa, Ontario, Canada)

Abstract

The capabilities of evolutionary algorithms (EAs) in solving nonlinear and non-convex optimization problems are significant. Differential evolution (DE) is an effective population-based EA, which has emerged as very competitive. Since its inception in 1995, multiple variants of DE have been proposed with higher performance. Among these DE variants, opposition-based differential evolution (ODE) established a novel concept in which individuals must compete with theirs opposites in order to make an entry in the next generation. The generation of opposite points is based on the current extreme points (i.e., maximum and minimum) in the search space. This paper develops a new scheme that utilizes the centroid point of a population to calculate opposite individuals. The classical scheme of an opposite point is modified. Incorporating this new scheme into DE leads to an enhanced ODE that is identified as centroid opposition-based differential evolution (CODE). The accuracy of the CODE algorithm is comprehensively evaluated on well-known complex benchmark functions and compared with the performance of conventional DE, ODE, and other state-of-the-art algorithms. The results for CODE are found to be promising.

Suggested Citation

  • Shahryar Rahnamayan & Jude Jesuthasan & Farid Bourennani & Greg F. Naterer & Hojjat Salehinejad, 2014. "Centroid Opposition-Based Differential Evolution," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 5(4), pages 1-25, October.
    • Handle: RePEc:igg:jamc00:v:5:y:2014:i:4:p:1-25
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2014100101
    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:5:y:2014:i:4:p:1-25. 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.