Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4945560 | International Journal of Electrical Power & Energy Systems | 2017 | 9 Pages |
Abstract
This study determines optimum aggregation areas for a given distribution network considering spatial distribution of loads and costs of aggregation. An elitist genetic algorithm combined with a hierarchical clustering and a Thevenin network reduction is implemented to compute strategic locations and aggregate demand within each area. The aggregation reduces large distribution networks having thousands of nodes to an equivalent network with few aggregated loads, thereby significantly reducing the computational burden. Furthermore, it not only helps distribution system operators in making faster operational decisions by understanding during which time of the day will be in need of flexibility, from which specific area, and in which amount, but also enables the flexibilities stemming from small distributed resources to be traded in various power/energy markets. A combination of central and local aggregation scheme where a central aggregator enables market participation, while local aggregators materialize the accepted bids, is implemented to realize this concept. The effectiveness of the proposed method is evaluated by comparing network performances with and without aggregation. For a given network configuration, steady-state performance of aggregated network is significantly accurate (â±1.5% error) compared to very high errors associated with forecast of individual consumer demand.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Bishnu P. Bhattarai, Kurt S. Myers, Brigitte Bak-Jensen, Iker Diaz de Cerio Mendaza, Robert J. Turk, Jake P. Gentle,