基于对立的Cauchy变异遗传算法的函数优化

M. Iqbal, N. K. Khan, M. Jaffar, M. Ramzan, A. R. Baig
{"title":"基于对立的Cauchy变异遗传算法的函数优化","authors":"M. Iqbal, N. K. Khan, M. Jaffar, M. Ramzan, A. R. Baig","doi":"10.1109/ICISA.2010.5480382","DOIUrl":null,"url":null,"abstract":"Evolutionary algorithms (EA) have been used in data classification and data clustering task since the advent of these algorithms. Nonlinear complex optimization problems have been the area of interest since very long time. The EA have been applied successfully on these optimization problems. The evolutionary algorithms suffer a lot due to their slow convergence rate, mainly due to evolutionary nature of these algorithms. This paper presents a new mutation scheme for opposition based genetic algorithms (OGA-CM). This scheme tunes the population during evolutionary process effectively by using Cauchy Mutation (CM). The performance of the algorithm is tested over suit of 5 functions. Opposition based Genetic Algorithm (OGA) is used as competitor algorithm to compare the results of the proposed algorithm. The results show that the proposed method outperforms GA and OGA for most of the test functions.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Opposition Based Genetic Algorithm with Cauchy Mutation for Function Optimization\",\"authors\":\"M. Iqbal, N. K. Khan, M. Jaffar, M. Ramzan, A. R. Baig\",\"doi\":\"10.1109/ICISA.2010.5480382\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Evolutionary algorithms (EA) have been used in data classification and data clustering task since the advent of these algorithms. Nonlinear complex optimization problems have been the area of interest since very long time. The EA have been applied successfully on these optimization problems. The evolutionary algorithms suffer a lot due to their slow convergence rate, mainly due to evolutionary nature of these algorithms. This paper presents a new mutation scheme for opposition based genetic algorithms (OGA-CM). This scheme tunes the population during evolutionary process effectively by using Cauchy Mutation (CM). The performance of the algorithm is tested over suit of 5 functions. Opposition based Genetic Algorithm (OGA) is used as competitor algorithm to compare the results of the proposed algorithm. The results show that the proposed method outperforms GA and OGA for most of the test functions.\",\"PeriodicalId\":313762,\"journal\":{\"name\":\"2010 International Conference on Information Science and Applications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Information Science and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICISA.2010.5480382\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Information Science and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISA.2010.5480382","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

进化算法(EA)自出现以来,一直被用于数据分类和数据聚类任务。长期以来,非线性复杂优化问题一直是人们感兴趣的领域。该方法已成功地应用于这些优化问题。进化算法由于其缓慢的收敛速度而遭受了很大的损失,这主要是由于这些算法的进化特性。提出了一种新的基于对立的遗传算法(OGA-CM)突变方案。该方案利用柯西突变(Cauchy Mutation, CM)对进化过程中的种群进行了有效的调整。在5个函数集上测试了算法的性能。采用基于反对派的遗传算法(OGA)作为竞争对手算法,对所提算法的结果进行比较。结果表明,该方法在大多数测试函数上优于GA和OGA。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Opposition Based Genetic Algorithm with Cauchy Mutation for Function Optimization
Evolutionary algorithms (EA) have been used in data classification and data clustering task since the advent of these algorithms. Nonlinear complex optimization problems have been the area of interest since very long time. The EA have been applied successfully on these optimization problems. The evolutionary algorithms suffer a lot due to their slow convergence rate, mainly due to evolutionary nature of these algorithms. This paper presents a new mutation scheme for opposition based genetic algorithms (OGA-CM). This scheme tunes the population during evolutionary process effectively by using Cauchy Mutation (CM). The performance of the algorithm is tested over suit of 5 functions. Opposition based Genetic Algorithm (OGA) is used as competitor algorithm to compare the results of the proposed algorithm. The results show that the proposed method outperforms GA and OGA for most of the test functions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信