Performance assessment and exhaustive listing of 500+ nature inspired metaheuristic algorithms

12/19/2022
by   Zhongqiang Ma, et al.
0

Metaheuristics are popularly used in various fields, and they have attracted much attention in the scientific and industrial communities. In recent years, the number of new metaheuristic names has been continuously growing. Generally, the inventors attribute the novelties of these new algorithms to inspirations from either biology, human behaviors, physics, or other phenomena. In addition, these new algorithms, compared against basic versions of other metaheuristics using classical benchmark problems without shift/rotation, show competitive performances. In this study, we exhaustively tabulate more than 500 metaheuristics. To comparatively evaluate the performance of the recent competitive variants and newly proposed metaheuristics, 11 newly proposed metaheuristics and 4 variants of established metaheuristics are comprehensively compared on the CEC2017 benchmark suite. In addition, whether these algorithms have a search bias to the center of the search space is investigated. The results show that the performance of the newly proposed EBCM (effective butterfly optimizer with covariance matrix adaptation) algorithm performs comparably to the 4 well performing variants of the established metaheuristics and possesses similar properties and behaviors, such as convergence, diversity, exploration and exploitation trade-offs, in many aspects. The performance of all 15 of the algorithms is likely to deteriorate due to certain transformations, while the 4 state-of-the-art metaheuristics are less affected by transformations such as the shifting of the global optimal point away from the center of the search space. It should be noted that, except EBCM, the other 10 new algorithms proposed mostly during 2019-2020 are inferior to the well performing 2017 variants of differential evolution and evolution strategy in terms of convergence speed and global search ability on CEC 2017 functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/10/2011

Convergence Analysis of Differential Evolution Variants on Unconstrained Global Optimization Functions

In this paper, we present an empirical study on convergence nature of Di...
research
08/16/2021

Orthogonal learning covariance matrix for defect of grey wolf optimizer: Insights, balance, diversity, and feature selection

This research’s genesis is in two aspects: first, a guaranteed solution ...
research
03/16/2019

On-line Search History-assisted Restart Strategy for Covariance Matrix Adaptation Evolution Strategy

Restart strategy helps the covariance matrix adaptation evolution strate...
research
05/30/2012

State Transition Algorithm

In terms of the concepts of state and state transition, a new heuristic ...
research
10/05/2018

Memetic Viability Evolution for Constrained Optimization

The performance of evolutionary algorithms can be heavily undermined whe...
research
08/28/2021

Chaos embedded opposition based learning for gravitational search algorithm

Due to its robust search mechanism, Gravitational search algorithm (GSA)...
research
02/01/2017

Optimal Experimental Design of Field Trials using Differential Evolution

When setting up field experiments, to test and compare a range of genoty...

Please sign up or login with your details

Forgot password? Click here to reset