4.7 Article

Optimal Clustering of Time Periods for Electricity Demand-Side Management

期刊

IEEE TRANSACTIONS ON POWER SYSTEMS
卷 28, 期 4, 页码 3842-3851

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2013.2252373

关键词

Demand-side management; dynamic programming; electricity supply industry; integer linear programming; load management; mathematical programming; minimax techniques; optimization; power system planning

向作者/读者索取更多资源

Several pure binary integer optimization models are developed for clustering time periods by similarity for electricity utilities seeking assistance with pricing strategies. The models include alternative objectives for characterizing various notions of within-cluster distances, admit as feasible only clusters that are contiguous, and allow for circularity, where time periods at the beginning and end of the planning cycle may be in the same cluster. Restrictions upon cluster size may conveniently be included without the need of additional constraints. The models are populated with a real-world dataset of electricity usage for 93 buildings and solutions and run-times attained by conventional optimization software are compared with those by dynamic programming, or by a greedy algorithm applicable to one of the models, that run in polynomial time. The results provide time-of-use segments that an electricity utility may employ for selective pricing for peak and off-peak time periods to influence demand for the purpose of load leveling.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据