Dynamic Yin-Yang Pair Optimization and its performance on single objective real parameter problems of CEC 2017

Yin-Yang Pair Optimization is a recently developed metaheuristic technique which searches for the global optima through two stages namely splitting stage and archive stage. A variant of this algorithm is proposed in this work by converting a static archive updating interval to a dynamic one. The performance of this variant is evaluated on the CEC2017 test suite for single objective bound constrained real-parameter numerical optimization problems that is used for the Special Session and Competition of CEC 2017. The results obtained by this algorithm reveals its competitive performance.