Enhancing modified cuckoo search by using Mantegna Lévy flights and chaotic sequences

Patchara Nasa-Ngium, K. Sunat, S. Chiewchanwattana
{"title":"Enhancing modified cuckoo search by using Mantegna Lévy flights and chaotic sequences","authors":"Patchara Nasa-Ngium, K. Sunat, S. Chiewchanwattana","doi":"10.1109/JCSSE.2013.6567319","DOIUrl":null,"url":null,"abstract":"In this paper, we present an improvement of the modified cuckoo search (MCS) method. We focus on a new nest generation from the top nest group. This group of nests assists a better local search. We use Tent map chaotic sequences to replace the constant parameter, inverse golden ratio of MCS. This process aims to find a better solution in case of multi-modal problems. The Cauchy Lévy distribution is replaced by Mantegna Lévy distribution generation. This process assists in finding a better solution in case of uni-modal problems. To construct a more suitable with wider optimization problems and good convergence property, these two concepts are combined together as Improved MCS with Chaotic Sequences algorithm (ICMCS). The proposed algorithm is verified using nineteen constrained optimization problems. The performance of the proposed algorithm is compared with the original MCS algorithms. The optimal solutions obtained in this study are more superior to MCS.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2013.6567319","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

Abstract

In this paper, we present an improvement of the modified cuckoo search (MCS) method. We focus on a new nest generation from the top nest group. This group of nests assists a better local search. We use Tent map chaotic sequences to replace the constant parameter, inverse golden ratio of MCS. This process aims to find a better solution in case of multi-modal problems. The Cauchy Lévy distribution is replaced by Mantegna Lévy distribution generation. This process assists in finding a better solution in case of uni-modal problems. To construct a more suitable with wider optimization problems and good convergence property, these two concepts are combined together as Improved MCS with Chaotic Sequences algorithm (ICMCS). The proposed algorithm is verified using nineteen constrained optimization problems. The performance of the proposed algorithm is compared with the original MCS algorithms. The optimal solutions obtained in this study are more superior to MCS.
利用Mantegna l飞行和混沌序列增强改进布谷鸟搜索
本文提出了一种改进的修正杜鹃搜索(MCS)方法。我们专注于从顶层巢群中选出新一代。这群巢穴有助于更好地在当地搜索。我们用Tent映射混沌序列代替MCS的常参数逆黄金比例。这个过程的目的是在多模态问题的情况下找到一个更好的解决方案。柯西lsamy分布被Mantegna lsamy分布代所取代。这个过程有助于在单模态问题的情况下找到更好的解决方案。为了构造一个更适用于更广泛的优化问题和良好的收敛性,将这两个概念结合为改进的混沌序列算法(ICMCS)。通过19个约束优化问题对该算法进行了验证。将该算法的性能与原有的MCS算法进行了比较。本研究得到的最优解比MCS更优。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信