Semi-steady-state Jaya Algorithm

07/13/2020
by   Uday K. Chakraborty, et al.
0

The Jaya algorithm is arguably one of the fastest-emerging metaheuristics amongst the newest members of the evolutionary computation family. The present paper proposes a new, improved Jaya algorithm by modifying the update strategies of the best and the worst members in the population. Simulation results on a twelve-function benchmark test-suite as well as a real-world problem of practical importance show that the proposed strategy produces results that are better and faster in the majority of cases. Statistical tests of significance are used to validate the performance improvement.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/15/2020

Improving Neuroevolution Using Island Extinction and Repopulation

Neuroevolution commonly uses speciation strategies to better explore the...
research
02/14/2022

Stochastic models of Jaya and semi-steady-state Jaya algorithms

We build stochastic models for analyzing Jaya and semi-steady-state Jaya...
research
03/25/2022

Component-wise Analysis of Automatically Designed Multiobjective Algorithms on Constrained Problems

The performance of multiobjective algorithms varies across problems, mak...
research
07/16/2020

Community aware group testing

Group testing pools together diagnostic samples to reduce the number of ...
research
11/25/2020

Best response dynamics on random graphs

We consider evolutionary games on a population whose underlying topology...
research
02/13/2019

Dynamic Solution Probability Acceptance within the Flower Pollination Algorithm for t-way Test Suite Generation

Flower Pollination Algorithm (FPA) is the new breed of metaheuristic for...
research
01/28/2022

Improving Group Testing via Gradient Descent

We study the problem of group testing with non-identical, independent pr...

Please sign up or login with your details

Forgot password? Click here to reset