TSASC: tree–seed algorithm with sine–cosine enhancement for continuous optimization problems

Abstract

Tree–seed algorithm (TSA) establishes a novel approach to solve continuous optimization problems, which is applied in many fields because of its simplicity and strength in finding optimal solutions. However, due to somewhat imbalance of its ability between exploration and exploitation in different search phases, the exploratory capability of TSA is relatively weak in optimizing multimodal and high-dimensional objective functions. To make some improvements, we propose a hybrid heuristic tree–seed algorithm named TSASC by integrating two features from sine–cosine algorithm. The proposed algorithm is then tested in comparison with TSA and other relevant algorithms through 30 benchmark functions from IEEE CEC 2014 and 3 constrained real engineering optimization problems. The results prove its enhanced balance between exploration and exploitation in both finding better global optimal solutions and effectively avoiding falling into local optimum, which shows that it has promising advantages in solving continuous optimization problems in engineering practices.