Cited 14 time in
Optimal Hourly Scheduling of Community-Aggregated Electricity Consumption
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Khodaei, Amin | - |
| dc.contributor.author | Shahidehpour, Mohammad | - |
| dc.contributor.author | Choi, Jaeseok | - |
| dc.date.accessioned | 2022-12-27T00:19:32Z | - |
| dc.date.available | 2022-12-27T00:19:32Z | - |
| dc.date.issued | 2013-11 | - |
| dc.identifier.issn | 1975-0102 | - |
| dc.identifier.issn | 2093-7423 | - |
| dc.identifier.uri | https://scholarworks.gnu.ac.kr/handle/sw.gnu/20394 | - |
| dc.description.abstract | This paper presents the optimal scheduling of hourly consumption in a residential community (community, neighborhood, etc.) based on real-time electricity price. The residential community encompasses individual residential loads, communal (shared) loads, and local generation. Community-aggregated loads, which include residential and communal loads, are modeled as fixed, adjustable, shiftable, and storage loads. The objective of the optimal load scheduling problem is to minimize the community-aggregated electricity payment considering the convenience of individual residents and hourly community load characteristics. Limitations are included on the hourly utility load (defined as community-aggregated load minus the local generation) that is imported from the utility grid. Lagrangian relaxation (LR) is applied to decouple the utility constraint and provide tractable subproblems. The decomposed subproblems are formulated as mixed-integer programming (MIP) problems. The proposed model would be used by community master controllers to optimize the utility load schedule and minimize the community-aggregated electricity payment. Illustrative optimal load scheduling examples of a single resident as well as an aggregated community including 200 residents are presented to show the efficiency of the proposed method based on real-time electricity price. | - |
| dc.format.extent | 10 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | SPRINGER SINGAPORE PTE LTD | - |
| dc.title | Optimal Hourly Scheduling of Community-Aggregated Electricity Consumption | - |
| dc.type | Article | - |
| dc.publisher.location | 싱가폴 | - |
| dc.identifier.doi | 10.5370/JEET.2013.8.6.1251 | - |
| dc.identifier.scopusid | 2-s2.0-84886006827 | - |
| dc.identifier.wosid | 000325978200001 | - |
| dc.identifier.bibliographicCitation | JOURNAL OF ELECTRICAL ENGINEERING & TECHNOLOGY, v.8, no.6, pp 1251 - 1260 | - |
| dc.citation.title | JOURNAL OF ELECTRICAL ENGINEERING & TECHNOLOGY | - |
| dc.citation.volume | 8 | - |
| dc.citation.number | 6 | - |
| dc.citation.startPage | 1251 | - |
| dc.citation.endPage | 1260 | - |
| dc.type.docType | Article | - |
| dc.identifier.kciid | ART001813280 | - |
| dc.description.isOpenAccess | Y | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.description.journalRegisteredClass | kci | - |
| dc.relation.journalResearchArea | Engineering | - |
| dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
| dc.subject.keywordPlus | SMART | - |
| dc.subject.keywordPlus | ENERGY | - |
| dc.subject.keywordPlus | MANAGEMENT | - |
| dc.subject.keywordPlus | SYSTEM | - |
| dc.subject.keywordAuthor | Residential community | - |
| dc.subject.keywordAuthor | Hourly community-aggregated load scheduling | - |
| dc.subject.keywordAuthor | Real-time electricity price | - |
| dc.subject.keywordAuthor | Lagrangian relaxation | - |
| dc.subject.keywordAuthor | Mixed integer program | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Gyeongsang National University Central Library, 501, Jinju-daero, Jinju-si, Gyeongsangnam-do, 52828, Republic of Korea+82-55-772-0532
COPYRIGHT 2022 GYEONGSANG NATIONAL UNIVERSITY LIBRARY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
