Performance Evaluation of Jaya Algorithm During Search Space Violation

Abstract

In this work, the efficiency and performance of the Jaya optimizer are evaluated for two different initialization methods. In the course of the entire iterative process, these starting approaches are used whenever an aspect of any explanation violates the exploration area. The violating aspect is initially set up in the first technique close to the edge of the exploration area. In the second, the violating aspect of the exploration area is initialized at irregularly. For performance comparison, eight different unimodal measure exercises are reduced using the modified Jaya approach. The appraisal of the evenhanded exercise, or figure of merit, along with its mean, minimum, standard deviation, and maximum appraisals are used to compare efficacy and performance.