Nature-inspired optimization method: Hydrozoan algorithm for solving continuous problems

Daranat Tansui, A. Thammano
{"title":"Nature-inspired optimization method: Hydrozoan algorithm for solving continuous problems","authors":"Daranat Tansui, A. Thammano","doi":"10.1109/SNPD.2017.8022695","DOIUrl":null,"url":null,"abstract":"In this article, a new optimization algorithm that is inspired by the biology of hydrozoa (HA) is proposed. Our aim was to develop an algorithm that is based on the regeneration and transplantation processes of hydrozoa for finding the best solutions for continuous optimization problems. Basically, HA follows the same general processes of evolutionary algorithm; however, its distinctive processes mimic the life cycle of 3 basic forms of hydrozoa: motile planula, polyps, and medusa. In particular, the growth of strong buds from the polyp stage depends on levels of morphogens: activators and inhibitors. These 3 forms develop or evolve into the best solution. HA was performance tested with 20 standard benchmark functions and compared with genetic algorithm and Particle Swarm Optimization (PSO). The test results have confirmed that the proposed algorithm is computationally more efficient than both GA and PSO. It works very well on most benchmark functions.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"199 1-6","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNPD.2017.8022695","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this article, a new optimization algorithm that is inspired by the biology of hydrozoa (HA) is proposed. Our aim was to develop an algorithm that is based on the regeneration and transplantation processes of hydrozoa for finding the best solutions for continuous optimization problems. Basically, HA follows the same general processes of evolutionary algorithm; however, its distinctive processes mimic the life cycle of 3 basic forms of hydrozoa: motile planula, polyps, and medusa. In particular, the growth of strong buds from the polyp stage depends on levels of morphogens: activators and inhibitors. These 3 forms develop or evolve into the best solution. HA was performance tested with 20 standard benchmark functions and compared with genetic algorithm and Particle Swarm Optimization (PSO). The test results have confirmed that the proposed algorithm is computationally more efficient than both GA and PSO. It works very well on most benchmark functions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
自然启发的优化方法:求解连续问题的Hydrozoan算法
本文提出了一种受水螅(HA)生物学启发的优化算法。我们的目标是开发一种基于水螅体再生和移植过程的算法,以寻找连续优化问题的最佳解决方案。基本上,HA遵循与进化算法相同的一般过程;然而,其独特的过程模拟了三种基本形式的水螅动物的生命周期:活动的浮藻、息肉和水母。特别是,从息肉期开始的强芽的生长取决于形态因子的水平:激活剂和抑制剂。这三种形式发展或演变为最佳解决方案。采用20个标准基准函数对HA进行了性能测试,并对遗传算法和粒子群算法进行了比较。实验结果表明,该算法的计算效率高于遗传算法和粒子群算法。它在大多数基准函数上运行得非常好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Performance analysis of localization strategy for island model genetic algorithm Relationship between the five factor model personality and learning effectiveness of teams in three information systems education courses Evaluating the work of experienced and inexperienced developers considering work difficulty in sotware development Intrusion detection using clustering of network traffic flows Intelligent integrated coking flue gas indices prediction
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1