基于Pareto-Nash均衡的有源配电网多利益相关者最优调度

Jinling Lu, Yuxing Wei, Hang Yang, Jinpeng Huang, Fei Wang
{"title":"基于Pareto-Nash均衡的有源配电网多利益相关者最优调度","authors":"Jinling Lu, Yuxing Wei, Hang Yang, Jinpeng Huang, Fei Wang","doi":"10.1109/IAS.2019.8912412","DOIUrl":null,"url":null,"abstract":"Distributed generation operators and users involved in demand response(DR) have gradually become new stakeholders in the active distribution network (ADN), while different stakeholders have different optimization dispatch objectives. Aiming at the problem optimal dispatch of distribution grid with multi-stakeholder participation, this paper first introduce the concept of virtual-microgrid (V-MG), and the multi-objective optimal dispatch model of independent stakeholder is established by constructing a joint optimal dispatch platform of ADN. Secondly, this paper introduces information entropy to improve the traditional NSGA-II algorithm and proposes a new NSGAEN algorithm. The NSGAEN algorithm can improve convergence speed and avoid falling into local optimum. Finally, a method for selecting the compromise solution in the Pareto optimal solution set by Nash equilibrium game is proposed, which can effectively solve the problem of excessive human preference factors in choosing the compromise solution. The effectiveness of the proposed model and algorithm is verified by an example of 33-node distribution network.","PeriodicalId":376719,"journal":{"name":"2019 IEEE Industry Applications Society Annual Meeting","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optimal Dispatch of Multi-stakeholder Based on Pareto-Nash Equilibrium Game for Active Distribution Network\",\"authors\":\"Jinling Lu, Yuxing Wei, Hang Yang, Jinpeng Huang, Fei Wang\",\"doi\":\"10.1109/IAS.2019.8912412\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Distributed generation operators and users involved in demand response(DR) have gradually become new stakeholders in the active distribution network (ADN), while different stakeholders have different optimization dispatch objectives. Aiming at the problem optimal dispatch of distribution grid with multi-stakeholder participation, this paper first introduce the concept of virtual-microgrid (V-MG), and the multi-objective optimal dispatch model of independent stakeholder is established by constructing a joint optimal dispatch platform of ADN. Secondly, this paper introduces information entropy to improve the traditional NSGA-II algorithm and proposes a new NSGAEN algorithm. The NSGAEN algorithm can improve convergence speed and avoid falling into local optimum. Finally, a method for selecting the compromise solution in the Pareto optimal solution set by Nash equilibrium game is proposed, which can effectively solve the problem of excessive human preference factors in choosing the compromise solution. The effectiveness of the proposed model and algorithm is verified by an example of 33-node distribution network.\",\"PeriodicalId\":376719,\"journal\":{\"name\":\"2019 IEEE Industry Applications Society Annual Meeting\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE Industry Applications Society Annual Meeting\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IAS.2019.8912412\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Industry Applications Society Annual Meeting","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAS.2019.8912412","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

分布式发电运营商和参与需求响应(DR)的用户逐渐成为主动配电网(ADN)中新的利益相关者,而不同的利益相关者有着不同的优化调度目标。针对多利益相关者参与配电网优化调度问题,首先引入虚拟微电网(V-MG)的概念,通过构建ADN联合优化调度平台,建立了独立利益相关者的多目标优化调度模型。其次,引入信息熵对传统的NSGA-II算法进行改进,提出了一种新的NSGAEN算法。NSGAEN算法可以提高收敛速度,避免陷入局部最优。最后,提出了一种利用纳什均衡对策在Pareto最优解集中选择折衷解的方法,有效地解决了人类在选择折衷解时偏好因素过多的问题。通过一个33节点配电网的算例验证了该模型和算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal Dispatch of Multi-stakeholder Based on Pareto-Nash Equilibrium Game for Active Distribution Network
Distributed generation operators and users involved in demand response(DR) have gradually become new stakeholders in the active distribution network (ADN), while different stakeholders have different optimization dispatch objectives. Aiming at the problem optimal dispatch of distribution grid with multi-stakeholder participation, this paper first introduce the concept of virtual-microgrid (V-MG), and the multi-objective optimal dispatch model of independent stakeholder is established by constructing a joint optimal dispatch platform of ADN. Secondly, this paper introduces information entropy to improve the traditional NSGA-II algorithm and proposes a new NSGAEN algorithm. The NSGAEN algorithm can improve convergence speed and avoid falling into local optimum. Finally, a method for selecting the compromise solution in the Pareto optimal solution set by Nash equilibrium game is proposed, which can effectively solve the problem of excessive human preference factors in choosing the compromise solution. The effectiveness of the proposed model and algorithm is verified by an example of 33-node distribution network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信