J. Pezoa, L. García-Santander, A. Carcamo-Gallardo
{"title":"配电网优化的可扩展分布式算法","authors":"J. Pezoa, L. García-Santander, A. Carcamo-Gallardo","doi":"10.1109/SCCC.2009.9","DOIUrl":null,"url":null,"abstract":"Utilities are interested in obtaining optimal operational topologies for their distribution power-grids so that they can efficiently employ grid resources, and simultaneously, increase their profits while providing a specified quality-of-service (QoS) to their customers. This paper presents a distributed and scalable algorithm for yielding an optimal power-grid topology that minimizes the (QoS) metric called energy not supplied (ENS) by the distribution grid. The (ENS) is minimized by constructing both local, independent minimum weight spanning trees (MWSTs) and a global yet unique (MWST) for the entire grid. At each step of the distributed algorithm, agents exchange information about their local (MWST) in order to coordinately construct the global (MWST). In addition, the distributed algorithm exploits heuristics to supply extra decision criteria to the agents constructing the (MWST) of the power grid.","PeriodicalId":398661,"journal":{"name":"2009 International Conference of the Chilean Computer Science Society","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Scalable Distributed Algorithm for Optimizing Distribution Power-Grids\",\"authors\":\"J. Pezoa, L. García-Santander, A. Carcamo-Gallardo\",\"doi\":\"10.1109/SCCC.2009.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Utilities are interested in obtaining optimal operational topologies for their distribution power-grids so that they can efficiently employ grid resources, and simultaneously, increase their profits while providing a specified quality-of-service (QoS) to their customers. This paper presents a distributed and scalable algorithm for yielding an optimal power-grid topology that minimizes the (QoS) metric called energy not supplied (ENS) by the distribution grid. The (ENS) is minimized by constructing both local, independent minimum weight spanning trees (MWSTs) and a global yet unique (MWST) for the entire grid. At each step of the distributed algorithm, agents exchange information about their local (MWST) in order to coordinately construct the global (MWST). In addition, the distributed algorithm exploits heuristics to supply extra decision criteria to the agents constructing the (MWST) of the power grid.\",\"PeriodicalId\":398661,\"journal\":{\"name\":\"2009 International Conference of the Chilean Computer Science Society\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference of the Chilean Computer Science Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCCC.2009.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference of the Chilean Computer Science Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCCC.2009.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Scalable Distributed Algorithm for Optimizing Distribution Power-Grids
Utilities are interested in obtaining optimal operational topologies for their distribution power-grids so that they can efficiently employ grid resources, and simultaneously, increase their profits while providing a specified quality-of-service (QoS) to their customers. This paper presents a distributed and scalable algorithm for yielding an optimal power-grid topology that minimizes the (QoS) metric called energy not supplied (ENS) by the distribution grid. The (ENS) is minimized by constructing both local, independent minimum weight spanning trees (MWSTs) and a global yet unique (MWST) for the entire grid. At each step of the distributed algorithm, agents exchange information about their local (MWST) in order to coordinately construct the global (MWST). In addition, the distributed algorithm exploits heuristics to supply extra decision criteria to the agents constructing the (MWST) of the power grid.