Quantum Mating Operator: A New Approach to Evolve Chromosomes in Genetic Algorithms

G. Acampora, Roberto Schiattarella, A. Vitiello
{"title":"Quantum Mating Operator: A New Approach to Evolve Chromosomes in Genetic Algorithms","authors":"G. Acampora, Roberto Schiattarella, A. Vitiello","doi":"10.1109/CEC55065.2022.9870425","DOIUrl":null,"url":null,"abstract":"Genetic Algorithms (GAs) are optimization methods that search near-optimal solutions by applying well-known operations such as selection, crossover and mutation. In particular, crossover and mutation are aimed at creating new solutions from selected parents with the goal of discovering better and better solutions in the search space. In literature, several approaches have been defined to create new solutions from the mating pool to try to improve the performance of genetic optimization. In this paper, the literature is enriched by introducing a new mating operator that harnesses the stochastic nature of quantum computation to evolve individuals in a classical genetic workflow. This new approach, named Quantum Mating Operator, acts as a multi-parent operator that identifies alleles' frequency patterns from a collection of individuals selected by means of conventional selection operators, and encodes them through a quantum state. This state is successively mutated and measured to generate a new classical chromosome. As shown by experimental results, GAs equipped with the proposed operator outperform those equipped with traditional crossover and mutation operators when used to solve well-known benchmark functions.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC55065.2022.9870425","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Genetic Algorithms (GAs) are optimization methods that search near-optimal solutions by applying well-known operations such as selection, crossover and mutation. In particular, crossover and mutation are aimed at creating new solutions from selected parents with the goal of discovering better and better solutions in the search space. In literature, several approaches have been defined to create new solutions from the mating pool to try to improve the performance of genetic optimization. In this paper, the literature is enriched by introducing a new mating operator that harnesses the stochastic nature of quantum computation to evolve individuals in a classical genetic workflow. This new approach, named Quantum Mating Operator, acts as a multi-parent operator that identifies alleles' frequency patterns from a collection of individuals selected by means of conventional selection operators, and encodes them through a quantum state. This state is successively mutated and measured to generate a new classical chromosome. As shown by experimental results, GAs equipped with the proposed operator outperform those equipped with traditional crossover and mutation operators when used to solve well-known benchmark functions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
量子配对算子:遗传算法中染色体进化的新方法
遗传算法是一种通过选择、交叉和变异等众所周知的操作来搜索接近最优解的优化方法。特别是,交叉和突变旨在从选定的双亲中创建新的解决方案,目的是在搜索空间中发现越来越好的解决方案。在文献中,已经定义了几种方法来从交配池中创建新的解决方案,以试图提高遗传优化的性能。在本文中,通过引入一种新的交配算子来丰富文献,该算子利用量子计算的随机特性来进化经典遗传工作流中的个体。这种新方法被称为量子配对算子,它作为一个多亲本算子,从传统选择算子选择的个体集合中识别等位基因的频率模式,并通过量子态对它们进行编码。这种状态被连续地突变和测量以产生一个新的经典染色体。实验结果表明,采用该算子的遗传算法在求解知名基准函数时优于传统的交叉算子和变异算子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Impacts of Single-objective Landscapes on Multi-objective Optimization Cooperative Multi-objective Topology Optimization Using Clustering and Metamodeling Global and Local Area Coverage Path Planner for a Reconfigurable Robot A New Integer Linear Program and A Grouping Genetic Algorithm with Controlled Gene Transmission for Joint Order Batching and Picking Routing Problem Test Case Prioritization and Reduction Using Hybrid Quantum-behaved Particle Swarm Optimization
×
引用
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