{"title":"电网PEV负荷资源分配的分布约束","authors":"David Ganger, Ahmed E. Ewaisha","doi":"10.1109/NAPS.2013.6666907","DOIUrl":null,"url":null,"abstract":"Social and economic pressures are inducing the proliferation of plug-in electric vehicles (PEVs) in the market. As the power grid has a limited supply of electricity, this problem can be formulated as a resource allocation problem, minimizing costs of charging. In this paper we model the PEV charging problem to minimize the total cost of charging, taking into account distribution constraints. These constraints model the maximum power that distribution-lines can carry as a function of time. Moreover, we develop an algorithm to schedule the PEVs aiming at minimizing the total charging cost, subject to these instantaneous distribution constraints. Although the proposed algorithm is a suboptimal one, it is of a polynomial complexity in the number of PEVs in the system.","PeriodicalId":421943,"journal":{"name":"2013 North American Power Symposium (NAPS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Distribution constraints on resource allocation of PEV load in the power grid\",\"authors\":\"David Ganger, Ahmed E. Ewaisha\",\"doi\":\"10.1109/NAPS.2013.6666907\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Social and economic pressures are inducing the proliferation of plug-in electric vehicles (PEVs) in the market. As the power grid has a limited supply of electricity, this problem can be formulated as a resource allocation problem, minimizing costs of charging. In this paper we model the PEV charging problem to minimize the total cost of charging, taking into account distribution constraints. These constraints model the maximum power that distribution-lines can carry as a function of time. Moreover, we develop an algorithm to schedule the PEVs aiming at minimizing the total charging cost, subject to these instantaneous distribution constraints. Although the proposed algorithm is a suboptimal one, it is of a polynomial complexity in the number of PEVs in the system.\",\"PeriodicalId\":421943,\"journal\":{\"name\":\"2013 North American Power Symposium (NAPS)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 North American Power Symposium (NAPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAPS.2013.6666907\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 North American Power Symposium (NAPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAPS.2013.6666907","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distribution constraints on resource allocation of PEV load in the power grid
Social and economic pressures are inducing the proliferation of plug-in electric vehicles (PEVs) in the market. As the power grid has a limited supply of electricity, this problem can be formulated as a resource allocation problem, minimizing costs of charging. In this paper we model the PEV charging problem to minimize the total cost of charging, taking into account distribution constraints. These constraints model the maximum power that distribution-lines can carry as a function of time. Moreover, we develop an algorithm to schedule the PEVs aiming at minimizing the total charging cost, subject to these instantaneous distribution constraints. Although the proposed algorithm is a suboptimal one, it is of a polynomial complexity in the number of PEVs in the system.