New Routing Application Using Bees Colony for Energy Internet

Amani Fawaz, I. Mougharbel, H. Kanaan
{"title":"New Routing Application Using Bees Colony for Energy Internet","authors":"Amani Fawaz, I. Mougharbel, H. Kanaan","doi":"10.1109/SGRE53517.2022.9774114","DOIUrl":null,"url":null,"abstract":"The Energy Internet (EI) is a power system evolution that aims to incorporate renewable energy into the energy network, reduce the size and cost of energy storage devices, and improve energy efficiency. Furthermore, the development of the peer-to-peer energy trading market, which allows any subscriber to participate in the energy trading process, has raised the necessity of the energy routing process. Subscriber matching, energy-efficient paths, and transmission scheduling issues must all be considered throughout the energy routing process. Based on graph theory, this paper suggested a novel routing approach inspired by bees’ colony foraging behavior to address routing issues. The bees’ colony-inspired energy routing approach was developed to determine a non-congestion minimum loss path and the optimal energy producers to satisfy the consumer request while considering power and time restrictions. Furthermore, this technique supports singlesource consumers, multi-source consumers, and multiple consumers’ scenarios. The performance of the proposed protocol is compared to an existing method in the literature in terms of power losses, congestion management, and computation time. The suggested method’s performance and adaptability have been validated in several different scenarios.","PeriodicalId":64562,"journal":{"name":"智能电网与可再生能源(英文)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"智能电网与可再生能源(英文)","FirstCategoryId":"1087","ListUrlMain":"https://doi.org/10.1109/SGRE53517.2022.9774114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The Energy Internet (EI) is a power system evolution that aims to incorporate renewable energy into the energy network, reduce the size and cost of energy storage devices, and improve energy efficiency. Furthermore, the development of the peer-to-peer energy trading market, which allows any subscriber to participate in the energy trading process, has raised the necessity of the energy routing process. Subscriber matching, energy-efficient paths, and transmission scheduling issues must all be considered throughout the energy routing process. Based on graph theory, this paper suggested a novel routing approach inspired by bees’ colony foraging behavior to address routing issues. The bees’ colony-inspired energy routing approach was developed to determine a non-congestion minimum loss path and the optimal energy producers to satisfy the consumer request while considering power and time restrictions. Furthermore, this technique supports singlesource consumers, multi-source consumers, and multiple consumers’ scenarios. The performance of the proposed protocol is compared to an existing method in the literature in terms of power losses, congestion management, and computation time. The suggested method’s performance and adaptability have been validated in several different scenarios.
基于蜂群的能源互联网路由新应用
能源互联网(Energy Internet, EI)是一种电力系统的发展,旨在将可再生能源纳入能源网络,减少储能设备的尺寸和成本,提高能源效率。此外,点对点能源交易市场的发展,允许任何订户参与能源交易过程,提高了能源路由过程的必要性。用户匹配、节能路径和传输调度问题必须在整个能源路由过程中加以考虑。本文在图论的基础上,提出了一种受蜂群觅食行为启发的路由方法来解决路由问题。在考虑电力和时间限制的情况下,提出了蜂群能量路由方法,以确定无拥塞的最小损失路径和满足消费者需求的最优能量生产者。此外,该技术支持单源消费者、多源消费者和多个消费者场景。在功率损耗、拥塞管理和计算时间方面,将该协议的性能与文献中的现有方法进行了比较。该方法的性能和适应性已在多个不同的场景中得到验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
307
×
引用
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学术官方微信