Reliability-based preventive maintenance scheduling in power generation systems: A lévy flight and chaotic local search-based discrete mayfly algorithm

IF 4 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Soufiane Belagoune , Konstantinos Zervoudakis , Bousaadia Baadji , Atif Karim , Noureddine Bali
{"title":"Reliability-based preventive maintenance scheduling in power generation systems: A lévy flight and chaotic local search-based discrete mayfly algorithm","authors":"Soufiane Belagoune ,&nbsp;Konstantinos Zervoudakis ,&nbsp;Bousaadia Baadji ,&nbsp;Atif Karim ,&nbsp;Noureddine Bali","doi":"10.1016/j.compeleceng.2024.109904","DOIUrl":null,"url":null,"abstract":"<div><div>An adequate and reliable precautionary upkeep plan in power generation systems is required to reduce failures, to improve the generator's lifespan, to diminish repair costs and to ensure consistent power supply to consumers with managing the energy flows in power systems. The Generators’ Precautionary Upkeep Planning (GPUP) problem is a complex optimization problem. It is a critical challenge in the power generation industry, involving the optimization of maintenance schedules for power generators to minimize the generation reserve and maximize the reliability. This problem consists of several important restrictions which include the load power demand and the labour force restrictions. In this research paper, a Discrete Chaotic Mayfly Optimization (DCMFO) algorithm which uses Lévy flight random walk for female mayflies and chaotic local search move rule for male ones, is adapted for designing an appropriate precautionary upkeep scheme of a list of generators in power generation systems. The DCMFO algorithm is evaluated using 21-unit test thermal power system. The results indicate that unlike the classical DMFO algorithm, the DCMFO algorithm has proven to have superior optimization capabilities and to surpass all earlier adopted algorithms in performance. This reinforces DCMFO's standing as the current leading optimization algorithm for solving this particular problem, ever since its initial inception. The DCMFO's efficiency and reliability have been demonstrated with different cases through several statistical tests.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"121 ","pages":"Article 109904"},"PeriodicalIF":4.0000,"publicationDate":"2024-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Electrical Engineering","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0045790624008309","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

An adequate and reliable precautionary upkeep plan in power generation systems is required to reduce failures, to improve the generator's lifespan, to diminish repair costs and to ensure consistent power supply to consumers with managing the energy flows in power systems. The Generators’ Precautionary Upkeep Planning (GPUP) problem is a complex optimization problem. It is a critical challenge in the power generation industry, involving the optimization of maintenance schedules for power generators to minimize the generation reserve and maximize the reliability. This problem consists of several important restrictions which include the load power demand and the labour force restrictions. In this research paper, a Discrete Chaotic Mayfly Optimization (DCMFO) algorithm which uses Lévy flight random walk for female mayflies and chaotic local search move rule for male ones, is adapted for designing an appropriate precautionary upkeep scheme of a list of generators in power generation systems. The DCMFO algorithm is evaluated using 21-unit test thermal power system. The results indicate that unlike the classical DMFO algorithm, the DCMFO algorithm has proven to have superior optimization capabilities and to surpass all earlier adopted algorithms in performance. This reinforces DCMFO's standing as the current leading optimization algorithm for solving this particular problem, ever since its initial inception. The DCMFO's efficiency and reliability have been demonstrated with different cases through several statistical tests.
为了减少故障,提高发电机的使用寿命,降低维修成本,并通过管理电力系统中的能量流确保为用户提供稳定的电力供应,需要在发电系统中制定适当、可靠的预防性维护计划。发电机预防性维护规划(GPUP)问题是一个复杂的优化问题。它是发电行业面临的一个重要挑战,涉及优化发电机的维护计划,以最大限度地减少发电储备,最大限度地提高可靠性。这个问题包含几个重要的限制条件,其中包括负荷电力需求和劳动力限制。本文采用离散混沌蜉蝣优化算法(DCMFO),对雌性蜉蝣使用莱维飞行随机漫步,对雄性蜉蝣使用混沌局部搜索移动规则,为发电系统中的一系列发电机设计适当的预防性维护方案。利用 21 台试验火电系统对 DCMFO 算法进行了评估。结果表明,与经典的 DMFO 算法不同,DCMFO 算法已被证明具有卓越的优化能力,在性能上超越了所有早期采用的算法。这巩固了 DCMFO 自诞生以来在解决这一特定问题方面的领先地位。DCMFO 的效率和可靠性已通过若干统计测试在不同案例中得到了证明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Electrical Engineering
Computers & Electrical Engineering 工程技术-工程:电子与电气
CiteScore
9.20
自引率
7.00%
发文量
661
审稿时长
47 days
期刊介绍: The impact of computers has nowhere been more revolutionary than in electrical engineering. The design, analysis, and operation of electrical and electronic systems are now dominated by computers, a transformation that has been motivated by the natural ease of interface between computers and electrical systems, and the promise of spectacular improvements in speed and efficiency. Published since 1973, Computers & Electrical Engineering provides rapid publication of topical research into the integration of computer technology and computational techniques with electrical and electronic systems. The journal publishes papers featuring novel implementations of computers and computational techniques in areas like signal and image processing, high-performance computing, parallel processing, and communications. Special attention will be paid to papers describing innovative architectures, algorithms, and software tools.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信