首页> 中文期刊>计算机、材料和连续体(英文) >A New Metaheuristic Approach to Solving Benchmark Problems: Hybrid Salp Swarm Jaya Algorithm

A New Metaheuristic Approach to Solving Benchmark Problems: Hybrid Salp Swarm Jaya Algorithm

     

摘要

Metaheuristic algorithms are one of the methods used to solve optimization problems and find global or close to optimal solutions at a reasonable computational cost.As 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 algorithms.In this study,a hybrid algorithm(HSSJAYA)consisting of salp swarm algorithm(SSA)and jaya algorithm(JAYA)is designed.The 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 algorithms.The hybrid algorithm is based on SSA’s leader and follower salp system and JAYA’s best and worst solution part.HSSJAYA works according to the best and worst food source positions.In this way,it is thought that the leader-follower salps will find the best solution to reach the food source.The hybrid algorithm has been tested in 14 unimodal and 21 multimodal benchmark functions.The 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 obtained.In addition,these results were statistically compared using wilcoxon rank sum test with other algorithms.According 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.

著录项

相似文献

  • 中文文献
  • 外文文献
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号