Semi-Steady-State Jaya Algorithm for Optimization

Uday K. Chakraborty

doi:10.3390/APP10155388

Semi-Steady-State Jaya Algorithm for Optimization

Uday K. Chakraborty

University of Missouri-St. Louis

Research output: Contribution to journal › Article › peer-review

Abstract

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 and a real-world problem 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.

Original language	American English
Journal	Applied Sciences
Volume	10
DOIs	https://doi.org/10.3390/APP10155388
State	Published - Aug 4 2020

Disciplines

Computer Sciences
Theory and Algorithms

Access to Document

10.3390/APP10155388License: Unspecified

applsci-10-05388-v2.pdfFinal published version, 301 KBLicense: Unspecified

Cite this

@article{4cae2113e6cf4657b54d5952b18ad1ea,

title = "Semi-Steady-State Jaya Algorithm for Optimization",

abstract = " 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 and a real-world problem 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. ",

author = "Chakraborty, \{Uday K.\}",

year = "2020",

month = aug,

day = "4",

doi = "10.3390/APP10155388",

language = "American English",

volume = "10",

journal = "Applied Sciences",

}

TY - JOUR

T1 - Semi-Steady-State Jaya Algorithm for Optimization

AU - Chakraborty, Uday K.

PY - 2020/8/4

Y1 - 2020/8/4

N2 - 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 and a real-world problem 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.

AB - 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 and a real-world problem 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.

U2 - 10.3390/APP10155388

DO - 10.3390/APP10155388

M3 - Article

VL - 10

JO - Applied Sciences

JF - Applied Sciences

ER -