An Analytical Polytope Approximation Aggregation of Electric Vehicles Considering Uncertainty for the Day-Ahead Distribution Network Dispatching
Jing Jian, Mingyang Zhang, Yinliang Xu, Wenjun Tang, Shan He
Abstract
The integration of large-scale heterogeneous electric vehicles (EVs) into the distribution network increases the system management complexity significantly. Due to the flexible charging/discharging operation and shiftable energy consumption during the parking time, EVs possess a great dispatching potential for the distribution network. This article develops an analytical polytope approximation (APA) aggregation model to efficiently depict the dispatchable regions of large-scale EVs with uncertainties and proposes a bilevel cooperative optimization approach for EV aggregators to participate in the distribution network day-ahead optimal scheduling. Uncertainties of EVs are modeled by chance constraints with different confidence levels to accommodate various regulatory requirements. The proposed approach can obtain large-scale EVs dispatchable capabilities with minimum flexibility loss and realize the regulation command disaggregation without violations. Numerical case studies are conducted on IEEE 33-bus and 141-bus distribution networks based on real data sets, which show that the proposed approach outperforms other state-of-art methods in terms of low operation flexibility conservatism, high system economics, and computational efficiency.