Reduced Yin-Yang-Pair optimization and its performance on the CEC 2016 expensive case
Varun Punnathanam, Prakash R. Kotecha · 2016
We present a variant of the Yin-Yang-Pair Optimization metaheuristic which accommodates computationally expensive numerical optimization problems more effectively. The variations are directed at simplifying the algorithm as well as enabling it to utilize functional evaluations more efficiently. The performance of Reduced Yin-Yang-Pair Optimization is tested on the functions used for the CEC 2016 Special Session on Bound Constrained Single-Objective Computationally Expensive Numerical Optimization. Additionally, the performance of the algorithm is evaluated based on the criteria specified for the same. The RYYPO is shown to have a significantly low time complexity while simultaneously providing highly competitive performance.