{"title":"Multi-objective planning for distributed generation in distribution network","authors":"Xiaobo Tang, G. Tang","doi":"10.1109/DRPT.2008.4523861","DOIUrl":null,"url":null,"abstract":"A multi-objective optimal model is proposed that takes into account minimizing the investment cost of DG and the power loss of distribution network, maximizing the static voltage stability margin, and enhancing the reliability of supply. This model is the weighted sum of individual objective functions. And AHP is adopted to determine the weights. An Improved multi population genetic algorithm is applied to realize multi-objective planning for DG. Example of IEEE-43 shows that the proposed method is practical.","PeriodicalId":240420,"journal":{"name":"2008 Third International Conference on Electric Utility Deregulation and Restructuring and Power Technologies","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Third International Conference on Electric Utility Deregulation and Restructuring and Power Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DRPT.2008.4523861","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19
Abstract
A multi-objective optimal model is proposed that takes into account minimizing the investment cost of DG and the power loss of distribution network, maximizing the static voltage stability margin, and enhancing the reliability of supply. This model is the weighted sum of individual objective functions. And AHP is adopted to determine the weights. An Improved multi population genetic algorithm is applied to realize multi-objective planning for DG. Example of IEEE-43 shows that the proposed method is practical.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
