Adaptive crossover operator based on locality and convergence

Myung-Sook Ko, Tae-Won Kang, C. Hwang
{"title":"Adaptive crossover operator based on locality and convergence","authors":"Myung-Sook Ko, Tae-Won Kang, C. Hwang","doi":"10.1109/IJSIS.1996.565046","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an adaptive crossover operator (ACO) for function optimization. ACO performs local improvement by restricting the crossover range in adaptive way. This approach is based on bias value which restrict the location of crossover point. Bias value is computed by the fitness function value performance ratio, and the number of generations. As generations progress, the portion of chromosome to apply ACO becomes much smaller. ACO scheme can reduce the computation complexity and escape from getting stuck local optimum and also by maintaining diversity if can maintain the balance between exploration and exploitation. Several experiments have been carried our to compare the performance of adaptive scheme and standard scheme. Compared to simple GA, the proposed method is faster and more accurate in finding global optimum.","PeriodicalId":437491,"journal":{"name":"Proceedings IEEE International Joint Symposia on Intelligence and Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE International Joint Symposia on Intelligence and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJSIS.1996.565046","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this paper, we propose an adaptive crossover operator (ACO) for function optimization. ACO performs local improvement by restricting the crossover range in adaptive way. This approach is based on bias value which restrict the location of crossover point. Bias value is computed by the fitness function value performance ratio, and the number of generations. As generations progress, the portion of chromosome to apply ACO becomes much smaller. ACO scheme can reduce the computation complexity and escape from getting stuck local optimum and also by maintaining diversity if can maintain the balance between exploration and exploitation. Several experiments have been carried our to compare the performance of adaptive scheme and standard scheme. Compared to simple GA, the proposed method is faster and more accurate in finding global optimum.
基于局部性和收敛性的自适应交叉算子
本文提出一种用于函数优化的自适应交叉算子(ACO)。蚁群算法通过自适应限制交叉范围来进行局部改进。该方法是基于偏差值来限制交叉点的位置。偏差值由适应度函数值、性能比和代数计算得到。随着世代的发展,应用蚁群控制的染色体比例越来越小。蚁群算法不仅可以减少计算量,避免陷入局部最优,而且通过保持多样性,可以保持勘探和开采的平衡。通过实验比较了自适应方案和标准方案的性能。与简单遗传算法相比,该方法具有更快、更准确的全局最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信