A comparative performance of different Type-1 tournament based metaheuristic algorithms in solving engineering beam design optimization problems and structural engineering design problems
摘要
Tournamenting process is one of the effective approaches for formulating hybrid algorithm in the recent years. In this work, four hybrid algorithms through tournamenting process are developed with the help of four popular and well-known metaheuristic algorithms, viz. teaching learning based optimization (TLBO), embedded cuckoo search (ECS), social group optimization (SGO) and honey badger algorithm (HBA). The resulting algorithms are named as T1-TLBO, T1-ECS, T1-SGO and T1-HBA. These algorithms are applied to solve structural engineering design problems. The results executed by proposed algorithms are compared numerically with a number of recently developed metaheuristic algorithms. Finally, to analyse the statistical significance of the proposed hybrid algorithms, two nonparametric statistical tests are performed and a fruitful conclusion is drawn.