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

Solving Mono- and Multi-Objective Problems Using Hybrid Evolutionary Algorithms and Nelder-Mead Method

Author

Listed:
  • Noureddine Boukhari

    (Mustapha Stambouli University, Mascara, Algeria)

  • Fatima Debbat

    (Mustapha Stambouli University, Mascara, Algeria)

  • Nicolas Monmarché

    (Laboratoire d'Informatique Fondamentale et Appliquée, Tours, France)

  • Mohamed Slimane

    (Laboratoire d'Informatique Fondamentale et Appliquée, Tours, France)

Abstract

Evolution strategies (ES) are a family of strong stochastic methods for global optimization and have proved their capability in avoiding local optima more than other optimization methods. Many researchers have investigated different versions of the original evolution strategy with good results in a variety of optimization problems. However, the convergence rate of the algorithm to the global optimum stays asymptotic. In order to accelerate the convergence rate, a hybrid approach is proposed using the nonlinear simplex method (Nelder-Mead) and an adaptive scheme to control the local search application, and the authors demonstrate that such combination yields significantly better convergence. The new proposed method has been tested on 15 complex benchmark functions and applied to the bi-objective portfolio optimization problem and compared with other state-of-the-art techniques. Experimental results show that the performance is improved by this hybridization in terms of solution eminence and strong convergence.

Suggested Citation

  • Noureddine Boukhari & Fatima Debbat & Nicolas Monmarché & Mohamed Slimane, 2021. "Solving Mono- and Multi-Objective Problems Using Hybrid Evolutionary Algorithms and Nelder-Mead Method," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 12(4), pages 98-116, October.
  • Handle: RePEc:igg:jamc00:v:12:y:2021:i:4:p:98-116
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2021100106
    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:12:y:2021:i:4:p:98-116. 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.