Optimal placement & sizing of DG's using backtracking search algorithm in IEEE 33-bus distribution system

D. Sai Krishna Kanth, N. Sree Ramula Reddy, R. Siva Gangadhar Reddy
{"title":"Optimal placement & sizing of DG's using backtracking search algorithm in IEEE 33-bus distribution system","authors":"D. Sai Krishna Kanth, N. Sree Ramula Reddy, R. Siva Gangadhar Reddy","doi":"10.1109/ICCMC.2017.8282667","DOIUrl":null,"url":null,"abstract":"This paper presents an efficient and fast-converging optimization technique based on a modification of the traditional big bang-big crunch method for optimal placement and sizing of voltage controlled distributed generators. The Proposed Backtracking Search Algorithm (BSA) has been applied on balanced and unbalanced distribution feeders and validated via comparing its results with published results done using different analytical and numerical methods. The method is capable of handling distribution systems of all sizes. A very recent swarm optimization technique namely backtracking search optimization algorithm (BSOA) is considered and compared with conventional Big Bang Big Crunch Method (BBBC). DGs supplying both active and reactive power have been studied. The proposed (BSA) algorithm is implemented in MATLAB environment and tested on the IEEE 33-bus feeder system.","PeriodicalId":163288,"journal":{"name":"2017 International Conference on Computing Methodologies and Communication (ICCMC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computing Methodologies and Communication (ICCMC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCMC.2017.8282667","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

This paper presents an efficient and fast-converging optimization technique based on a modification of the traditional big bang-big crunch method for optimal placement and sizing of voltage controlled distributed generators. The Proposed Backtracking Search Algorithm (BSA) has been applied on balanced and unbalanced distribution feeders and validated via comparing its results with published results done using different analytical and numerical methods. The method is capable of handling distribution systems of all sizes. A very recent swarm optimization technique namely backtracking search optimization algorithm (BSOA) is considered and compared with conventional Big Bang Big Crunch Method (BBBC). DGs supplying both active and reactive power have been studied. The proposed (BSA) algorithm is implemented in MATLAB environment and tested on the IEEE 33-bus feeder system.
基于回溯搜索算法的IEEE 33总线配电系统中DG的最优布局与尺寸
本文在对传统的大爆炸-大压缩优化方法进行改进的基础上,提出了一种高效、快速收敛的电压控制分布式发电机优化布置和尺寸优化技术。将所提出的回溯搜索算法(BSA)应用于平衡和不平衡配电馈线,并通过将其结果与已发表的不同解析和数值方法的结果进行比较,验证了该算法的有效性。该方法能够处理各种规模的配电系统。研究了一种最新的群体优化技术——回溯搜索优化算法(backtracking search optimization algorithm, BSOA),并与传统的大爆炸大压缩算法(Big Bang Big Crunch Method, BBBC)进行了比较。研究了同时提供有功和无功功率的dg。该算法在MATLAB环境下实现,并在IEEE 33总线馈线系统上进行了测试。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信