Single-Objective Real-Parameter Optimization: Enhanced LSHADE-SPACMA Algorithm
Real parameter optimization is one of the active research fields during the last decade. The performance of LSHADE-SPACMA was competitive in IEEE CEC’2017 competition on Single Objective Bound Constrained Real-Parameter Single Objective Optimization. Besides, it was ranked fourth among twelve papers were presented on and compared to this new benchmark problems. In this work, an improved version named ELSHADE-SPACMA is introduced. In LSHADE-SPACMA, p value that controls the greediness of the mutation strategy is constant. While in ELSHADE-SPACMA, p value is dynamic. Larger value of p will enhance the exploration, while smaller values will enhance the exploitation. We further enhanced the performance of ELSHADE-SPACMA by integrating another directed mutation strategy within the hybridization framework. The proposed algorithm has been evaluated using IEEE CEC’2017 benchmark. According to the comparison results, the proposed ELSHADE-SPACMA algorithm is better than LSHADE and LSHADE-SPACMA. Besides, The comparison results between ELSHADE-SPACMA and the best three algorithms from the IEEE CEC’2017 Competition indicate that ELSHADE-SPACMA algorithm shows overall better performance and it is highly competitive algorithm for solving global optimization problems. © 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.