Optimization of Water Distribution Network Design Using Rafflesia Optimization Algorithm Based on Opposition-based Learning

IF 0.9 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Journal of Internet Technology Pub Date : 2023-09-01 DOI:10.53106/160792642023092405006
Yu-Chung Huang Yu-Chung Huang, Qingyong Yang Yu-Chung Huang, Yu-Chun Huang Qingyong Yang, Jeng-Shyang Pan Yu-Chun Huang
{"title":"Optimization of Water Distribution Network Design Using Rafflesia Optimization Algorithm Based on Opposition-based Learning","authors":"Yu-Chung Huang Yu-Chung Huang, Qingyong Yang Yu-Chung Huang, Yu-Chun Huang Qingyong Yang, Jeng-Shyang Pan Yu-Chun Huang","doi":"10.53106/160792642023092405006","DOIUrl":null,"url":null,"abstract":"<p>About 70% of the total cost of the water distribution system is used in the design of water distribution network (WDN), and selecting the most suitable pipe diameter for the WDN is the main way to reduce construction costs. The Rafflesia optimization algorithm (ROA) is a novel meta-heuristic algorithm, which was proposed recently. It has the characteristics of escaping local optimal solutions and stable performance. To further increase the solution quality and convergence speed of the algorithm, the opposition-based learning strategy is adopted in this paper to initialize the ROA algorithm population (namely the OBLROA algorithm). In this paper, the two-loop pipe network is taken as an actual test case, and the OBLROA algorithm is used to design the minimum cost pipe diameter combination. The experimental results show that the OBLROA algorithm can find the lowest cost pipe diameter combination of the two-loop pipe network under the constraints of pressure and velocity. Compared with some previous research work, the OBLROA algorithm needs the least number of evaluations to find the optimal solution, showing strong competitiveness.</p> <p>&amp;nbsp;</p>","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.9000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Internet Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.53106/160792642023092405006","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

About 70% of the total cost of the water distribution system is used in the design of water distribution network (WDN), and selecting the most suitable pipe diameter for the WDN is the main way to reduce construction costs. The Rafflesia optimization algorithm (ROA) is a novel meta-heuristic algorithm, which was proposed recently. It has the characteristics of escaping local optimal solutions and stable performance. To further increase the solution quality and convergence speed of the algorithm, the opposition-based learning strategy is adopted in this paper to initialize the ROA algorithm population (namely the OBLROA algorithm). In this paper, the two-loop pipe network is taken as an actual test case, and the OBLROA algorithm is used to design the minimum cost pipe diameter combination. The experimental results show that the OBLROA algorithm can find the lowest cost pipe diameter combination of the two-loop pipe network under the constraints of pressure and velocity. Compared with some previous research work, the OBLROA algorithm needs the least number of evaluations to find the optimal solution, showing strong competitiveness.

&nbsp;

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于对立学习的Rafflesia优化算法在配水网络设计中的应用
供水管网的设计约占供水系统总成本的70%,选择最合适的管网管径是降低管网建设成本的主要途径。Rafflesia优化算法(ROA)是近年来提出的一种新颖的元启发式算法。它具有逃避局部最优解和性能稳定的特点。为了进一步提高算法的解质量和收敛速度,本文采用基于对立的学习策略初始化ROA算法种群(即OBLROA算法)。本文以双环管网为实际测试案例,采用obroa算法设计成本最小的管径组合。实验结果表明,obroa算法可以在压力和速度约束下找到成本最低的双环管网管径组合。与以往的一些研究工作相比,obroa算法需要最少的评价次数来找到最优解,表现出较强的竞争力。</p>& lt; p>,, & lt; / p>
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Internet Technology
Journal of Internet Technology COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
3.20
自引率
18.80%
发文量
112
审稿时长
13.8 months
期刊介绍: The Journal of Internet Technology accepts original technical articles in all disciplines of Internet Technology & Applications. Manuscripts are submitted for review with the understanding that they have not been published elsewhere. Topics of interest to JIT include but not limited to: Broadband Networks Electronic service systems (Internet, Intranet, Extranet, E-Commerce, E-Business) Network Management Network Operating System (NOS) Intelligent systems engineering Government or Staff Jobs Computerization National Information Policy Multimedia systems Network Behavior Modeling Wireless/Satellite Communication Digital Library Distance Learning Internet/WWW Applications Telecommunication Networks Security in Networks and Systems Cloud Computing Internet of Things (IoT) IPv6 related topics are especially welcome.
期刊最新文献
Abnormal Detection Method of Transship Based on Marine Target Spatio-Temporal Data Multidimensional Concept Map Representation of the Learning Objects Ontology Model for Personalized Learning Multiscale Convolutional Attention-based Residual Network Expression Recognition A Dynamic Access Control Scheme with Conditional Anonymity in Socio-Meteorological Observation A Behaviorally Evidence-based Method for Computing Spatial Comparisons of Image Scenarios
×
引用
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