Best-Worst-Play (BWP): A metaphor-less Optimization Algorithm

Abstract

Abstract A novel algorithm which is an ensemble of two metaphor-less algorithms is presented in this paper. The algorithm is inspired by Rao-1 and Jaya algorithms. Since the algorithm always plays around with the best and worst solutions; the algorithm is named as Best-Worst-Play (BWP) algorithm. The algorithm does not require any algorithm specific parameters, however, algorithm control parameters are required. To test the effectiveness and performance of the proposed algorithm, a number of unconstrained and constrained benchmark functions are considered. It is found that proposed algorithm has outperformed several well-established metaphor based algorithms. The proposed BWP algorithm may be used by researchers to solve the unconstrained and constrained optimization problems