{"title":"An Enhanced Fish School Search Algorithm","authors":"C. Bastos-Filho, D. O. Nascimento","doi":"10.1109/BRICS-CCI-CBIC.2013.34","DOIUrl":null,"url":null,"abstract":"Fish School Search (FSS) is swarm-based optimizer that excels on multimodal search problems, but presents some drawbacks, such as the necessity to proper define the step used in some operators and the need to evaluate the fitness function twice per fish per iteration. This paper presents a simpler and enhanced version of the FSS, that features three advantages over the original FSS: high exploitation capability, just one fitness evaluation per fish per iteration and easy implementation. We name this novel version as FSS-II. Our proposal was compared to the FSS and the two most used PSO variations in terms velocity of convergence and robustness in six benchmark functions. FSS-II outperformed the other approaches in most of cases.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":"2018 38","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18
Abstract
Fish School Search (FSS) is swarm-based optimizer that excels on multimodal search problems, but presents some drawbacks, such as the necessity to proper define the step used in some operators and the need to evaluate the fitness function twice per fish per iteration. This paper presents a simpler and enhanced version of the FSS, that features three advantages over the original FSS: high exploitation capability, just one fitness evaluation per fish per iteration and easy implementation. We name this novel version as FSS-II. Our proposal was compared to the FSS and the two most used PSO variations in terms velocity of convergence and robustness in six benchmark functions. FSS-II outperformed the other approaches in most of cases.
鱼群搜索(Fish School Search, FSS)是一种基于群体的优化器,它在多模态搜索问题上表现优异,但也存在一些缺点,例如在某些运算符中需要正确定义所使用的步骤,并且每次迭代需要对每条鱼评估两次适应度函数。本文提出了一种更简单和增强的FSS版本,与原始FSS相比,它具有三个优点:高开发能力,每次迭代只对每条鱼进行一次适应度评估,易于实现。我们将这个新版本命名为FSS-II。在六个基准函数的收敛速度和鲁棒性方面,我们的建议与FSS和两种最常用的PSO变量进行了比较。在大多数情况下,FSS-II优于其他方法。