IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/420652.html
   My bibliography  Save this article

An Improved Real-Coded Population-Based Extremal Optimization Method for Continuous Unconstrained Optimization Problems

Author

Listed:
  • Guo-Qiang Zeng
  • Kang-Di Lu
  • Jie Chen
  • Zheng-Jiang Zhang
  • Yu-Xing Dai
  • Wen-Wen Peng
  • Chong-Wei Zheng

Abstract

As a novel evolutionary optimization method, extremal optimization (EO) has been successfully applied to a variety of combinatorial optimization problems. However, the applications of EO in continuous optimization problems are relatively rare. This paper proposes an improved real-coded population-based EO method (IRPEO) for continuous unconstrained optimization problems. The key operations of IRPEO include generation of real-coded random initial population, evaluation of individual and population fitness, selection of bad elements according to power-law probability distribution, generation of new population based on uniform random mutation, and updating the population by accepting the new population unconditionally. The experimental results on 10 benchmark test functions with the dimension have shown that IRPEO is competitive or even better than the recently reported various genetic algorithm (GA) versions with different mutation operations in terms of simplicity, effectiveness, and efficiency. Furthermore, the superiority of IRPEO to other evolutionary algorithms such as original population-based EO, particle swarm optimization (PSO), and the hybrid PSO-EO is also demonstrated by the experimental results on some benchmark functions.

Suggested Citation

  • Guo-Qiang Zeng & Kang-Di Lu & Jie Chen & Zheng-Jiang Zhang & Yu-Xing Dai & Wen-Wen Peng & Chong-Wei Zheng, 2014. "An Improved Real-Coded Population-Based Extremal Optimization Method for Continuous Unconstrained Optimization Problems," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-9, May.
  • Handle: RePEc:hin:jnlmpe:420652
    DOI: 10.1155/2014/420652
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2014/420652.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2014/420652.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/420652?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
    ---><---

    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:hin:jnlmpe:420652. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.