Please use this identifier to cite or link to this item:
http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/4103
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dash, S. | - |
dc.contributor.author | Sodhi, R. | - |
dc.contributor.author | Sodhi, B. | - |
dc.date.accessioned | 2022-10-26T16:50:39Z | - |
dc.date.available | 2022-10-26T16:50:39Z | - |
dc.date.issued | 2022-10-26 | - |
dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/4103 | - |
dc.description.abstract | This paper proposes a decentralised pool-based local market model for a small energy community, intended to operate in parallel with an existing energy market, to manage the unscheduled active-hour (AH) appliances without violating the day-ahead nodal price of the community. The paper defines and targets this specific class of appliances with a two-stage iterative model. Stage-I calculates tentative AH sellers’ schedule and the clearing price to cater the unscheduled AH buyers’ needs. After getting the consensus from the AH sellers, Stage-II clears the pool. In every iteration, multiple rounds of information exchange ensure the maximisation of community-wide socialwelfare in the binary-controlled AH resources’ pool. The proposal is tested on the MATLAB platform with Gurobi solver using the Pecan-street’s NewYork dataset, and reveals that the application of the proposed model has a superior appliance management performance in a stringent demand response scenario. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Community Pool | en_US |
dc.subject | ADMM | en_US |
dc.subject | Decentralised OPF | en_US |
dc.subject | Active-Hour Appliance | en_US |
dc.subject | Demand Response | en_US |
dc.title | Community Pool Model for Active-Hour Appliance Management: A Multi-Round ADMM Approach | en_US |
dc.type | Article | en_US |
Appears in Collections: | Year-2022 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Full Text.pdf | 1.8 MB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.