Solving Mono- and Multi-Objective Problems Using Hybrid Evolutionary Algorithms and Nelder-Mead Method
Author:
Boukhari Noureddine1ORCID,
Debbat Fatima1,
Monmarché Nicolas2,
Slimane Mohamed2
Affiliation:
1. Mustapha Stambouli University, Mascara, Algeria
2. 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.
Subject
Decision Sciences (miscellaneous),Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Computer Science Applications,Modelling and Simulation,Statistics and Probability
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献