IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v7y2016i4p23-51.html
   My bibliography  Save this article

An Adaptive Population-based Simplex Method for Continuous Optimization

Author

Listed:
  • Mahamed G.H. Omran

    (Department of Computer Science, Gulf University for Science and Technology, Hawally, Kuwait)

  • Maurice Clerc

    (Independent Consultant, Groisy, France)

Abstract

This paper proposes a new population-based simplex method for continuous function optimization. The proposed method, called Adaptive Population-based Simplex (APS), is inspired by the Low-Dimensional Simplex Evolution (LDSE) method. LDSE is a recent optimization method, which uses the reflection and contraction steps of the Nelder-Mead Simplex method. Like LDSE, APS uses a population from which different simplexes are selected. In addition, a local search is performed using a hyper-sphere generated around the best individual in a simplex. APS is a tuning-free approach, it is easy to code and easy to understand. APS is compared with five state-of-the-art approaches on 23 functions where five of them are quasi-real-world problems. The experimental results show that APS generally performs better than the other methods on the test functions. In addition, a scalability study has been conducted and the results show that APS can work well with relatively high-dimensional problems.

Suggested Citation

  • Mahamed G.H. Omran & Maurice Clerc, 2016. "An Adaptive Population-based Simplex Method for Continuous Optimization," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 7(4), pages 23-51, October.
  • Handle: RePEc:igg:jsir00:v:7:y:2016:i:4:p:23-51
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.2016100102
    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:jsir00:v:7:y:2016:i:4:p:23-51. 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.