Enhance tree-seed algorithm using hierarchy mechanism for constrained optimization problems

Jianhua Jiang

doi:10.1016/j.eswa.2022.118311

Enhance tree-seed algorithm using hierarchy mechanism for constrained optimization problems

2022-12-01

8

PRE

AI

DOI：10.1016/j.eswa.2022.118311

原文链接

原文求助

摘要

En 中文

Tree-Seed Algorithm is a kind of swarm intelligence optimization algorithm. It is used to solve various problems widely, but it still has some shortcomings need to be overcame, such as imbalance between exploration and exploitation, local stagnation, premature convergence, and so on. In this study, an enhanced meta-heuristic optimization algorithm, called Migration Tree-Seed Algorithm (MTSA), is proposed inspiring by Grey Wolf Optimizer (GWO). The hierarchical gravity learning and random-based migration mechanisms are introduced to overcome the intrinsic defects of the basic TSA. Firstly, hierarchy mechanism ensures the tree migration to guide the seed generation avoiding the local stagnation. Secondly, random-based migration mechanism increases the seed diversity to improve the exploration ability. Finally, the coordinated update of the two mechanisms actuate a suitable trade-off between exploration ans exploitation. We use IEEE CEC 2014 benchmark functions to compare MTSA with basic TSA, the TSA variants (STSA, EST-TSA, fb_TSA), GWO, ABC, SCA, BOA, JAYA and RSA. MTSA is subsequently applied to three classical engineering design problems reported in the specialized literature. Both results show that the MTSA is very competitive and effective compared with other well-known meta-heuristics, proving its excellent applicability in real-world challenging problems with unknown search spaces.

Keyword:

Tree-seed algorithm

Grey Wolf optimizer

Continuous optimization problems

MTSA

Enhance tree-seed algorithm using hierarchy mechanism for constrained optimization problems

摘要

期刊

机构