确定电动汽车充电站最佳位置和规模的改进计算方法

IF 4 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Georgios Fotis
{"title":"确定电动汽车充电站最佳位置和规模的改进计算方法","authors":"Georgios Fotis","doi":"10.1016/j.compeleceng.2024.109840","DOIUrl":null,"url":null,"abstract":"<div><div>The increasing number of electric vehicles (EVs) will result in a rise in electric vehicle charging stations (EVCSs), which will have a significant effect on the electrical grid. One major issue is deciding where to place EVCSs in the power grid in the most optimal way. The distribution network is greatly impacted by inadequate EVCS prediction, which results in issues with frequency and voltage stability. This paper suggests an optimization method called Binary Random Dynamic Arithmetic Optimization Algorithm (BRDAOA) that is applied on an IEEE 33 bus network to determine the best position for EVCSs as efficiently as possible, and the Loss Sensitivity Factor (LSF) was used in the analysis. Considering the system voltage, the load (actual power), and the system losses, LSF was calculated for a variety of buses. The efficacy of the suggested method is demonstrated by a final comparison of its findings with those of the Arithmetic Optimization Algorithm (AOA) and two additional metaheuristic algorithms. In addition to reducing line losses by 2% compared to the AOA method and 4% compared to the other two metaheuristic optimization methods, the suggested optimization approach known as BRDAOA requires less computing time than the other three methods. Finally, a reliability test was conducted to determine the best location for EVCS in the IEEE 33 BUS system.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"120 ","pages":"Article 109840"},"PeriodicalIF":4.0000,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An improved arithmetic method for determining the optimum placement and size of EV charging stations\",\"authors\":\"Georgios Fotis\",\"doi\":\"10.1016/j.compeleceng.2024.109840\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The increasing number of electric vehicles (EVs) will result in a rise in electric vehicle charging stations (EVCSs), which will have a significant effect on the electrical grid. One major issue is deciding where to place EVCSs in the power grid in the most optimal way. The distribution network is greatly impacted by inadequate EVCS prediction, which results in issues with frequency and voltage stability. This paper suggests an optimization method called Binary Random Dynamic Arithmetic Optimization Algorithm (BRDAOA) that is applied on an IEEE 33 bus network to determine the best position for EVCSs as efficiently as possible, and the Loss Sensitivity Factor (LSF) was used in the analysis. Considering the system voltage, the load (actual power), and the system losses, LSF was calculated for a variety of buses. The efficacy of the suggested method is demonstrated by a final comparison of its findings with those of the Arithmetic Optimization Algorithm (AOA) and two additional metaheuristic algorithms. In addition to reducing line losses by 2% compared to the AOA method and 4% compared to the other two metaheuristic optimization methods, the suggested optimization approach known as BRDAOA requires less computing time than the other three methods. Finally, a reliability test was conducted to determine the best location for EVCS in the IEEE 33 BUS system.</div></div>\",\"PeriodicalId\":50630,\"journal\":{\"name\":\"Computers & Electrical Engineering\",\"volume\":\"120 \",\"pages\":\"Article 109840\"},\"PeriodicalIF\":4.0000,\"publicationDate\":\"2024-11-01\",\"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/S0045790624007675\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Electrical Engineering","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0045790624007675","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

电动汽车(EV)数量的增加将导致电动汽车充电站(EVCS)的增加,这将对电网产生重大影响。其中一个主要问题是决定如何以最佳方式将 EVCS 置于电网中。EVCS 预测不足会对配电网造成很大影响,从而导致频率和电压稳定性问题。本文提出了一种名为二进制随机动态优化算法(BRDAOA)的优化方法,应用于 IEEE 33 总线网络,以尽可能高效地确定 EVCS 的最佳位置,并在分析中使用了损耗敏感系数(LSF)。考虑到系统电压、负载(实际功率)和系统损耗,计算了各种总线的 LSF。通过与算术优化算法 (AOA) 和另外两种元启发式算法的结果进行最终比较,证明了所建议方法的有效性。与 AOA 方法相比,线路损耗降低了 2%,与另外两种元启发式优化方法相比,线路损耗降低了 4%,此外,建议的优化方法 BRDAOA 所需的计算时间也少于其他三种方法。最后,还进行了可靠性测试,以确定 EVCS 在 IEEE 33 BUS 系统中的最佳位置。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An improved arithmetic method for determining the optimum placement and size of EV charging stations
The increasing number of electric vehicles (EVs) will result in a rise in electric vehicle charging stations (EVCSs), which will have a significant effect on the electrical grid. One major issue is deciding where to place EVCSs in the power grid in the most optimal way. The distribution network is greatly impacted by inadequate EVCS prediction, which results in issues with frequency and voltage stability. This paper suggests an optimization method called Binary Random Dynamic Arithmetic Optimization Algorithm (BRDAOA) that is applied on an IEEE 33 bus network to determine the best position for EVCSs as efficiently as possible, and the Loss Sensitivity Factor (LSF) was used in the analysis. Considering the system voltage, the load (actual power), and the system losses, LSF was calculated for a variety of buses. The efficacy of the suggested method is demonstrated by a final comparison of its findings with those of the Arithmetic Optimization Algorithm (AOA) and two additional metaheuristic algorithms. In addition to reducing line losses by 2% compared to the AOA method and 4% compared to the other two metaheuristic optimization methods, the suggested optimization approach known as BRDAOA requires less computing time than the other three methods. Finally, a reliability test was conducted to determine the best location for EVCS in the IEEE 33 BUS system.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信