基于混合反比超突变算子的无约束全局优化实数编码克隆选择算法

V. Cutello, Giuseppe Nicosia, M. Pavone
{"title":"基于混合反比超突变算子的无约束全局优化实数编码克隆选择算法","authors":"V. Cutello, Giuseppe Nicosia, M. Pavone","doi":"10.1145/1141277.1141501","DOIUrl":null,"url":null,"abstract":"Numerical optimization of given objective functions is a crucial task in many real-life problems. This paper introduces a new immunological algorithm for continuous global optimization problems, called opt-IMMALG; it is an improved version of a previously proposed clonal selection algorithm, using a real-code representation and a new Inversely Proportional Hypermutation operator.We evaluate and assess the performance of opt-IMMALG and several others algorithms, namely opt-IA, PSO, arPSO, DE, and SEA with respect to their general applicability as numerical optimization algorithms. The experiments have been performed on 23 widely used benchmark problems.The experimental results show that opt-IMMALG is a suitable numerical optimization technique that, in terms of accuracy, outperforms the analyzed algorithms in this comparative study. In addition it is shown that opt-IMMALG is also suitable for solving large-scale problems.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"75","resultStr":"{\"title\":\"Real coded clonal selection algorithm for unconstrained global optimization using a hybrid inversely proportional hypermutation operator\",\"authors\":\"V. Cutello, Giuseppe Nicosia, M. Pavone\",\"doi\":\"10.1145/1141277.1141501\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Numerical optimization of given objective functions is a crucial task in many real-life problems. This paper introduces a new immunological algorithm for continuous global optimization problems, called opt-IMMALG; it is an improved version of a previously proposed clonal selection algorithm, using a real-code representation and a new Inversely Proportional Hypermutation operator.We evaluate and assess the performance of opt-IMMALG and several others algorithms, namely opt-IA, PSO, arPSO, DE, and SEA with respect to their general applicability as numerical optimization algorithms. The experiments have been performed on 23 widely used benchmark problems.The experimental results show that opt-IMMALG is a suitable numerical optimization technique that, in terms of accuracy, outperforms the analyzed algorithms in this comparative study. In addition it is shown that opt-IMMALG is also suitable for solving large-scale problems.\",\"PeriodicalId\":269830,\"journal\":{\"name\":\"Proceedings of the 2006 ACM symposium on Applied computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"75\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2006 ACM symposium on Applied computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1141277.1141501\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2006 ACM symposium on Applied computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1141277.1141501","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 75

摘要

给定目标函数的数值优化是许多现实问题中的关键任务。本文介绍了一种求解连续全局优化问题的免疫算法——opt-IMMALG;它是先前提出的克隆选择算法的改进版本,使用实码表示和新的反比例超突变算子。我们评估和评估了opt-IMMALG和其他几种算法的性能,即opt-IA, PSO, arPSO, DE和SEA,它们作为数值优化算法的一般适用性。在23个广泛使用的基准问题上进行了实验。实验结果表明,opt-IMMALG是一种合适的数值优化技术,在精度方面优于本对比研究中分析的算法。此外,还证明了opt-IMMALG也适用于解决大规模问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Real coded clonal selection algorithm for unconstrained global optimization using a hybrid inversely proportional hypermutation operator
Numerical optimization of given objective functions is a crucial task in many real-life problems. This paper introduces a new immunological algorithm for continuous global optimization problems, called opt-IMMALG; it is an improved version of a previously proposed clonal selection algorithm, using a real-code representation and a new Inversely Proportional Hypermutation operator.We evaluate and assess the performance of opt-IMMALG and several others algorithms, namely opt-IA, PSO, arPSO, DE, and SEA with respect to their general applicability as numerical optimization algorithms. The experiments have been performed on 23 widely used benchmark problems.The experimental results show that opt-IMMALG is a suitable numerical optimization technique that, in terms of accuracy, outperforms the analyzed algorithms in this comparative study. In addition it is shown that opt-IMMALG is also suitable for solving large-scale problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
File system framework for organizing sensor networks Editorial message: special track on operating systems and adaptive applications Simplifying transformation of software architecture constraints Session details: Software engineering: sound solutions for the 21st century To infinity and beyond or, avoiding the infinite in security protocol analysis
×
引用
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