Distributed intelligent algorithm for interdependent electrified transportation and power networks

Abstract

Plug-in Electric Vehicles (PEVs) play a pivotal role in transportation electrification. The flexible nature of PEVs' charging demand can be utilized for reducing charging cost as well as optimizing the operating cost of power and transportation networks. Utilizing charging flexibility of geographically spread PEVs requires design and implementation of efficient optimization algorithms. To this end, we propose a fully distributed algorithm to solve the PEVs' Cooperative Charging with Power constraints (PEV-CCP). Our solution considers the electric power limits that originate from physical characteristics of charging station, such as on-site transformer capacity limit, and allows for containing charging burden of PEVs on the electric distribution network. Our approach also enables plug- and-play and valley-filling capabilities of PEV charge scheduling. It distributes computation among agents (PEVs) to solve the PEV-CCP problem in a distributed fashion through an iterative interaction between neighboring agents. The structure of each agent's update functions ensures an agreement on a price signal while enforcing individual PEV constraints. In addition to converging towards the globally-optimum solution, our algorithm ensures the feasibility of each PEV's decision at each iteration. We have tested performance of the proposed approach using a fleet of PEVs. Simulation results verify the plug-and-play capability of the proposed approach by efficiently tracking the changes in terms of arrival/depart of PEVs.