A new adaptive Cuckoo search algorithm

N. M. Kumar, Maheshwari Rashmita Nath, Aneesh Wunnava, Siddharth Sahany, Rutuparna Panda
{"title":"A new adaptive Cuckoo search algorithm","authors":"N. M. Kumar, Maheshwari Rashmita Nath, Aneesh Wunnava, Siddharth Sahany, Rutuparna Panda","doi":"10.1109/ReTIS.2015.7232842","DOIUrl":null,"url":null,"abstract":"This paper presents a new adaptive Cuckoo search (ACS) algorithm based on the Cuckoo search (CS) for optimization. The main thrust is to decide the step size adaptively from its fitness value without using the Levy distribution. The other idea is to enhance the performance from the point of time and global minima. The performance of ACS against standard benchmark function show that the proposed algorithm converges to best solution with less time than Cuckoo search.","PeriodicalId":161306,"journal":{"name":"2015 IEEE 2nd International Conference on Recent Trends in Information Systems (ReTIS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"53","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 2nd International Conference on Recent Trends in Information Systems (ReTIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ReTIS.2015.7232842","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 53

Abstract

This paper presents a new adaptive Cuckoo search (ACS) algorithm based on the Cuckoo search (CS) for optimization. The main thrust is to decide the step size adaptively from its fitness value without using the Levy distribution. The other idea is to enhance the performance from the point of time and global minima. The performance of ACS against standard benchmark function show that the proposed algorithm converges to best solution with less time than Cuckoo search.
一种新的自适应布谷鸟搜索算法
在布谷鸟搜索算法的基础上,提出了一种新的自适应布谷鸟搜索算法(ACS)。其主要目的是在不使用Levy分布的情况下,从适应度值自适应地确定步长。另一个想法是从时间点和全局最小值来增强性能。ACS对标准基准函数的性能表明,该算法收敛到最优解的时间比布谷鸟搜索短。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书