基于禁忌的减载最小化启发式优化算法

J. Ferdous, Swakkhar Shatabda, M. N. Huda
{"title":"基于禁忌的减载最小化启发式优化算法","authors":"J. Ferdous, Swakkhar Shatabda, M. N. Huda","doi":"10.1109/ICAEE.2015.7506862","DOIUrl":null,"url":null,"abstract":"Efficient supply and distribution of energies in the power sector is a very important issue for development. The smart grid technologies allow the distribution and production of the commodity flow so that the proper communication is maintained and optimized depending on the demand. All the demand sites will be connected to the grid and the load over each sources are to be distributed in such a way that the load is minimized per source so that they can keep some of the power as residue. The power flow is required to be maintained continuously by choosing the best path which has minimum cost and transmission loss. For this different optimization technique could be used to be finding an optimal or maximal flow path for transmission. In this paper, we propose a deterministic graph model to represent the flow in the power grid and apply tabu-based heuristic local search to find the optimal flow such that the load shedding is being minimized. We applied a number of local search algorithms on different data sets and the results shows the potential for applying such meta-heuristic algorithms to solve the problem.","PeriodicalId":123939,"journal":{"name":"2015 International Conference on Advances in Electrical Engineering (ICAEE)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A tabu-based heuristic optimization algorithm for load shedding minimization\",\"authors\":\"J. Ferdous, Swakkhar Shatabda, M. N. Huda\",\"doi\":\"10.1109/ICAEE.2015.7506862\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Efficient supply and distribution of energies in the power sector is a very important issue for development. The smart grid technologies allow the distribution and production of the commodity flow so that the proper communication is maintained and optimized depending on the demand. All the demand sites will be connected to the grid and the load over each sources are to be distributed in such a way that the load is minimized per source so that they can keep some of the power as residue. The power flow is required to be maintained continuously by choosing the best path which has minimum cost and transmission loss. For this different optimization technique could be used to be finding an optimal or maximal flow path for transmission. In this paper, we propose a deterministic graph model to represent the flow in the power grid and apply tabu-based heuristic local search to find the optimal flow such that the load shedding is being minimized. We applied a number of local search algorithms on different data sets and the results shows the potential for applying such meta-heuristic algorithms to solve the problem.\",\"PeriodicalId\":123939,\"journal\":{\"name\":\"2015 International Conference on Advances in Electrical Engineering (ICAEE)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Advances in Electrical Engineering (ICAEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAEE.2015.7506862\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Advances in Electrical Engineering (ICAEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAEE.2015.7506862","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

电力部门能源的有效供应和分配是发展的一个非常重要的问题。智能电网技术允许商品流的分配和生产,以便根据需求维持和优化适当的通信。所有的需求站点都将连接到电网,每个源的负载将以这样一种方式分配,即每个源的负载最小,这样他们就可以保留一些电力作为剩余。通过选择成本最小、传输损耗最小的最佳路径,实现潮流的连续供电。因此,不同的优化技术可用于寻找最优或最大的传输流路。本文提出了一种确定性图模型来表示电网中的潮流,并应用基于禁忌的启发式局部搜索来寻找最优潮流,使减载最小化。我们在不同的数据集上应用了许多局部搜索算法,结果显示了应用这种元启发式算法来解决问题的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A tabu-based heuristic optimization algorithm for load shedding minimization
Efficient supply and distribution of energies in the power sector is a very important issue for development. The smart grid technologies allow the distribution and production of the commodity flow so that the proper communication is maintained and optimized depending on the demand. All the demand sites will be connected to the grid and the load over each sources are to be distributed in such a way that the load is minimized per source so that they can keep some of the power as residue. The power flow is required to be maintained continuously by choosing the best path which has minimum cost and transmission loss. For this different optimization technique could be used to be finding an optimal or maximal flow path for transmission. In this paper, we propose a deterministic graph model to represent the flow in the power grid and apply tabu-based heuristic local search to find the optimal flow such that the load shedding is being minimized. We applied a number of local search algorithms on different data sets and the results shows the potential for applying such meta-heuristic algorithms to solve the problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信