to other sources Motivation • Reduce greenhouse emission • “Free energy” Complexities • Intermittently available • Modeled here as a stochastic process
price to opportunistically buy power • Or store grid power bought at low price • Store unused renewable energy • Increase total number of EVs charged simultaneously Complexities • Capacity • Efficiency loss
• Energy requirements • Deadline • E.g., 0.25 MWh charge to be completed by 3pm • Define “Class of customer” = (Energy requirement, Deadline) • Demand for charging service affected by the price announced for each class
classes are random • Arrival process of each class is a function of the corresponding price for each class • What price to set? 0.1 MWh by 3 pm $20 0.1 MWh by 2 pm $30 0.2 MWh by 3 pm $25 0.2 MWh by 2 pm $35
• Grid power price • Renewable power supply • These are exogenous stochastic processes We can control • When and how much we buy grid power • Prices of different classes announced to customers • Scheduling of customers in the charging station to meet deadlines • These are control variables
What is profit? • [ Revenue derived from customers – Payment for grid power purchased ] What is revenue? • Each class: Number of customers of each class × Price • Total: Sum over all classes • Note that price influences the number of customers of each class
Inputs • Grid power price • Renewable power supply • Stochastic arrivals of customers of different classes with probability distribution affected by price Control variables • Prices of different classes announced to customers • When to buy power from grid and how much to buy • Time to start charging each customer Goal • Maximize expected total profit without missing customer deadlines
Energy consumed every 15 minutes One day 15 minutes Real time Top layer Set prices for different classes Middle layer How much power to buy How much power to store Bottom layer Scheduling of EVs to meet deadlines Connections between layers?
price to urgent customers • Shorter relative deadline • Less sensitive to prices Charge lower price to non-urgent customers • Longer relative deadline • More sensitive to prices
by top layer [ cost ] = [ Payment for grid power purchase + storage cost ] [ Number of Class 1 customers arrivals ] = [ Number of Class 2 customers arrivals ] = [ Price of grid power] = historical same-period data
• No deadlines are missed If charging rate for each charger is big enough, then solution is Earliest Deadline First policy: Else: More general stochastic scheduling problem Charge all EVs with 1 time slot relative deadline Then charge ( − )/ EVs with 2 slots relative deadline
Top layer • Quadratic programming • 3 + 6 + 5 variables to solve Middle layer • Discrete time dynamic programming • Sensitive to how finely we discretize the state and action space