Abstract
As the number of electric vehicles (EVs) continues to rise, it is essential to consider appropriate management strategies for coordinating EVs connected to different buses in the power networks. In light of this, this paper proposes a stochastic two-stage bi-level model for coordinating EVs in a distribution network with charging stations under alternating current optimal power flow (ACOPF) constraints. The scheduling problem is considered to independently minimize the costs of the distribution system operator (DSO) and EVs parked at different charging stations located at various buses of the network. In the proposed model, the DSO as the leader, and all EVs as independent followers, are individual entities who try to follow their priorities and objectives. The amount and price of exchanged power between the DSO and EVs are optimally determined in the proposed model. The proposed bi-level model has been converted to a single-level model using the Karush–Kuhn–Tucker (KKT) conditions. Afterwards, the Big M method is used to convert the non-linear equations that appear due to utilizing the KKT approach. The scenario-based uncertainty modeling is used to model the uncertainty in input data such as day-ahead and real-time market prices, EVs’ initial state of charge (SOC), and arrival/departure time. The centralized unilateral form of the model has also been developed to validate the proposed model. The results indicate that the bi-level model can lead to cost reduction for the EVs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.