Performance of Mixed Integer Non-linear Programming and Improved Harmony Search for optimal placement of DG units

Sandeep Kaur, G. Kumbhar, J. Sharma
{"title":"Performance of Mixed Integer Non-linear Programming and Improved Harmony Search for optimal placement of DG units","authors":"Sandeep Kaur, G. Kumbhar, J. Sharma","doi":"10.1109/PESGM.2014.6939165","DOIUrl":null,"url":null,"abstract":"Distribution system loss reduction is one of the prime objectives for planning of distributed generation. To minimize the losses, optimal sizing and siting of distributed generators (DGs) is critically important. In this paper, the nonlinear and non-convex optimization problem of placement DG units is solved using two methods, namely Mixed Integer Non-linear Programming (MINLP) and heuristic approach based Improved Harmony Search (IHS). Both MINLP and IHS based algorithms are implemented for optimal placement of single and multiple DG units capable of delivering either real or both real and reactive power. In MINLP formulation, the potential locations are obtained by sensitivity analysis to reduce the search space and then the problem is solved for optimal sizes and locations. The results are also obtained with IHS due to its non-monotonic solution surface. The proposed optimization approaches are tested on IEEE 33-bus distribution system. The results of proposed formulations are compared with Improved Analytical (IA) approach. Improved solutions and moderate computational time confirms the potential of MINLP based formulation.","PeriodicalId":149134,"journal":{"name":"2014 IEEE PES General Meeting | Conference & Exposition","volume":"101 10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE PES General Meeting | Conference & Exposition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PESGM.2014.6939165","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Distribution system loss reduction is one of the prime objectives for planning of distributed generation. To minimize the losses, optimal sizing and siting of distributed generators (DGs) is critically important. In this paper, the nonlinear and non-convex optimization problem of placement DG units is solved using two methods, namely Mixed Integer Non-linear Programming (MINLP) and heuristic approach based Improved Harmony Search (IHS). Both MINLP and IHS based algorithms are implemented for optimal placement of single and multiple DG units capable of delivering either real or both real and reactive power. In MINLP formulation, the potential locations are obtained by sensitivity analysis to reduce the search space and then the problem is solved for optimal sizes and locations. The results are also obtained with IHS due to its non-monotonic solution surface. The proposed optimization approaches are tested on IEEE 33-bus distribution system. The results of proposed formulations are compared with Improved Analytical (IA) approach. Improved solutions and moderate computational time confirms the potential of MINLP based formulation.
混合整数非线性规划性能及改进的协调搜索优化DG单元布局
降低配电系统损耗是分布式发电规划的主要目标之一。为了最大限度地减少损失,分布式发电机(dg)的优化尺寸和选址至关重要。本文采用混合整数非线性规划(MINLP)和启发式改进和谐搜索(IHS)两种方法解决了DG单元布置的非线性非凸优化问题。基于MINLP和IHS的算法都可以实现单个和多个DG单元的最佳配置,这些DG单元能够提供真实功率或真实功率和无功功率。在MINLP公式中,通过灵敏度分析得到潜在位置,减少搜索空间,然后求解最优尺寸和位置问题。由于his具有非单调的解面,也得到了同样的结果。提出的优化方法在IEEE 33总线配电系统上进行了测试。提出的公式的结果与改进的分析(IA)方法进行了比较。改进的解和适度的计算时间证实了基于MINLP的公式的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信