A New Metaheuristic Approach to Solving Benchmark Problems: Hybrid Salp Swarm Jaya Algorithm
作者机构：Department of Information TechnologiesTokat Vocational and Technical Anatolian High SchoolMerkez/Tokat60030Turkey Department of Computer EngineeringFaculty of TechnologyKonya Selcuk UniversitySelcuklu/Konya42130Turkey
出 版 物：《Computers, Materials & Continua》 (计算机、材料和连续体（英文）)
年 卷 期：2022年第71卷第5期
页 面：2923-2941页
核心收录：
学科分类：08[工学] 0837[工学-安全科学与工程] 0815[工学-水利工程] 0812[工学-计算机科学与技术（可授工学、理学学位）]
主 题：Metaheuristic optimization benchmark algorithm swarm hybrid
摘 要：Metaheuristic algorithms are one of the methods used to solve optimization problems and find global or close to optimal solutions at a reasonable computational *** with other types of algorithms,in metaheuristic algorithms,one of the methods used to improve performance and achieve results closer to the target result is the hybridization of *** this study,a hybrid algorithm(HSSJAYA)consisting of salp swarm algorithm(SSA)and jaya algorithm(JAYA)is *** speed of achieving the global optimum of SSA,its simplicity,easy hybridization and JAYA’s success in achieving the best solution have given us the idea of creating a powerful hybrid algorithm from these two *** hybrid algorithm is based on SSA’s leader and follower salp system and JAYA’s best and worst solution *** works according to the best and worst food source *** this way,it is thought that the leader-follower salps will find the best solution to reach the food *** hybrid algorithm has been tested in 14 unimodal and 21 multimodal benchmark *** results were compared with SSA,JAYA,cuckoo search algorithm(CS),firefly algorithm(FFA)and genetic algorithm(GA).As a result,a hybrid algorithm that provided results closer to the desired fitness value in benchmark functions was *** addition,these results were statistically compared using wilcoxon rank sum test with other *** to the statistical results obtained from the results of the benchmark functions,it was determined that HSSJAYA creates a statistically significant difference in most of the problems compared to other algorithms.
维普期刊数据库