Convergence analysis of beetle antennae search algorithm and its applications

04/04/2019
by   Yinyan Zhang, et al.
2

The beetle antennae search algorithm was recently proposed and investigated for solving global optimization problems. Although the performance of the algorithm and its variants were shown to be better than some existing meta-heuristic algorithms, there is still a lack of convergence analysis. In this paper, we provide theoretical analysis on the convergence of the beetle antennae search algorithm. We test the performance of the BAS algorithm via some representative benchmark functions. Meanwhile, some applications of the BAS algorithm are also presented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/28/2021

A Meta-Heuristic Search Algorithm based on Infrasonic Mating Displays in Peafowls

Meta-heuristic techniques are important as they are used to find solutio...
research
01/25/2018

Sine Cosine Crow Search Algorithm: A powerful hybrid meta heuristic for global optimization

This paper presents a novel hybrid algorithm named Since Cosine Crow Sea...
research
02/09/2022

New hard benchmark functions for global optimization

In this paper, we present some new unimodal, multimodal, and noise test ...
research
12/08/2022

Optimizing Integrated Information with a Prior Guided Random Search Algorithm

Integrated information theory (IIT) is a theoretical framework that prov...
research
11/09/2022

Automated Learning: An Implementation of The A* Search Algorithm over The Random Base Functions

This letter explains an algorithm for finding a set of base functions. T...
research
08/28/2021

Chaos embedded opposition based learning for gravitational search algorithm

Due to its robust search mechanism, Gravitational search algorithm (GSA)...
research
06/08/2016

A Modified Vortex Search Algorithm for Numerical Function Optimization

The Vortex Search (VS) algorithm is one of the recently proposed metaheu...

Please sign up or login with your details

Forgot password? Click here to reset