Performance evaluation of uranium enrichment cascades using fuzzy based harmony search algorithm

IF 7.5 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS Engineering Applications of Artificial Intelligence Pub Date : 2024-11-29 DOI:10.1016/j.engappai.2024.109710
S. Dadashzadeh, M. Aghaie
{"title":"Performance evaluation of uranium enrichment cascades using fuzzy based harmony search algorithm","authors":"S. Dadashzadeh,&nbsp;M. Aghaie","doi":"10.1016/j.engappai.2024.109710","DOIUrl":null,"url":null,"abstract":"<div><div>The production of energy in nuclear reactors needs enrichment of fuels. There is some interest in taking the fuel enrichment level to 3–5% by cascades. Optimization of the isotopic cascades is essential to make this process economic. This study presents a Fuzzy-based Harmony Search (FHS) algorithm aimed at dynamic parameter adaptation as well as establishing a balance between exploration and exploitation, which significantly increases the convergence speed of the algorithm. Accelerating the convergence of the algorithm is demonstrated in the Sphere, Schwefel, Ackley, and Drop-Waves benchmarks at first. This approach also enhances performance in several test cases of optimum cascade problems, with results validated through comparisons with conventional methods. According to the results, the total number of centrifuges using FHS reached 6306 in test case 1, which was reduced 44 pieces compared to the method used by Palkin, and 55 pieces compared to the real coded genetic algorithm. The total number of centrifuges using FHS reached 2808 in test case 4 with a different type of gas centrifuge, which decreased 27 pieces compared to the direct search method. Similar results were obtained in other test cases, indicating the effectiveness of the FHS algorithm in minimizing the total number of centrifuges and total flow rates.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"140 ","pages":"Article 109710"},"PeriodicalIF":7.5000,"publicationDate":"2024-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Applications of Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0952197624018682","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The production of energy in nuclear reactors needs enrichment of fuels. There is some interest in taking the fuel enrichment level to 3–5% by cascades. Optimization of the isotopic cascades is essential to make this process economic. This study presents a Fuzzy-based Harmony Search (FHS) algorithm aimed at dynamic parameter adaptation as well as establishing a balance between exploration and exploitation, which significantly increases the convergence speed of the algorithm. Accelerating the convergence of the algorithm is demonstrated in the Sphere, Schwefel, Ackley, and Drop-Waves benchmarks at first. This approach also enhances performance in several test cases of optimum cascade problems, with results validated through comparisons with conventional methods. According to the results, the total number of centrifuges using FHS reached 6306 in test case 1, which was reduced 44 pieces compared to the method used by Palkin, and 55 pieces compared to the real coded genetic algorithm. The total number of centrifuges using FHS reached 2808 in test case 4 with a different type of gas centrifuge, which decreased 27 pieces compared to the direct search method. Similar results were obtained in other test cases, indicating the effectiveness of the FHS algorithm in minimizing the total number of centrifuges and total flow rates.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于模糊协调搜索算法的铀浓缩级联性能评价
在核反应堆中生产能源需要对燃料进行浓缩。有人对通过级联将燃料浓缩水平提高到3-5%很感兴趣。同位素级联的优化是使这一过程经济有效的关键。本文提出了一种基于模糊的和谐搜索(FHS)算法,该算法旨在动态自适应参数,并在探索和利用之间建立平衡,显著提高了算法的收敛速度。首先在Sphere, Schwefel, Ackley和Drop-Waves基准测试中演示了加速算法的收敛性。该方法还在几个最优级联问题的测试用例中提高了性能,并通过与传统方法的比较验证了结果。结果表明,在测试用例1中,使用FHS的离心机总数达到6306台,比Palkin方法减少44台,比真实编码遗传算法减少55台。在不同型号气体离心机的试验用例4中,使用FHS的离心机总数达到2808台,比直接搜索法减少27台。在其他测试用例中也得到了类似的结果,表明FHS算法在最小化离心机总数和总流速方面是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Engineering Applications of Artificial Intelligence
Engineering Applications of Artificial Intelligence 工程技术-工程:电子与电气
CiteScore
9.60
自引率
10.00%
发文量
505
审稿时长
68 days
期刊介绍: Artificial Intelligence (AI) is pivotal in driving the fourth industrial revolution, witnessing remarkable advancements across various machine learning methodologies. AI techniques have become indispensable tools for practicing engineers, enabling them to tackle previously insurmountable challenges. Engineering Applications of Artificial Intelligence serves as a global platform for the swift dissemination of research elucidating the practical application of AI methods across all engineering disciplines. Submitted papers are expected to present novel aspects of AI utilized in real-world engineering applications, validated using publicly available datasets to ensure the replicability of research outcomes. Join us in exploring the transformative potential of AI in engineering.
期刊最新文献
Adaptive model-agnostic meta-learning network for cross-machine fault diagnosis with limited samples Deep interval type-2 generalized fuzzy hyperbolic tangent system for nonlinear regression prediction A multi-scale feature fusion network based on semi-channel attention for seismic phase picking Editorial Board Enhancing camouflaged object detection through contrastive learning and data augmentation techniques
×
引用
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