636 research outputs found
Near-optimal Online Algorithms for Joint Pricing and Scheduling in EV Charging Networks
With the rapid acceleration of transportation electrification, public
charging stations are becoming vital infrastructure in a smart sustainable city
to provide on-demand electric vehicle (EV) charging services. As more consumers
seek to utilize public charging services, the pricing and scheduling of such
services will become vital, complementary tools to mediate competition for
charging resources. However, determining the right prices to charge is
difficult due to the online nature of EV arrivals. This paper studies a joint
pricing and scheduling problem for the operator of EV charging networks with
limited charging capacity and time-varying energy cost. Upon receiving a
charging request, the operator offers a price, and the EV decides whether to
admit the offer based on its own value and the posted price. The operator then
schedules the real-time charging process to satisfy the charging request if the
EV admits the offer. We propose an online pricing algorithm that can determine
the posted price and EV charging schedule to maximize social welfare, i.e., the
total value of EVs minus the energy cost of charging stations. Theoretically,
we prove the devised algorithm can achieve the order-optimal competitive ratio
under the competitive analysis framework. Practically, we show the empirical
performance of our algorithm outperforms other benchmark algorithms in
experiments using real EV charging data
Smart green charging scheme of centralized electric vehicle stations
This paper presses a smart charging decision-making criterion that significantly contributes in enhancing the scheduling of the electric vehicles (EVs) during the charging process. The proposed criterion aims to optimize the charging time, select the charging methodology either DC constant current constant voltage (DC-CCCV) or DC multi-stage constant currents (DC-MSCC), maximize the charging capacity as well as minimize the queuing delay per EV, especially during peak hours. The decision-making algorithms have been developed by utilizing metaheuristic algorithms including the Genetic Algorithm (GA) and Water Cycle Optimization Algorithm (WCOA). The utility of the proposed models has been investigated while considering the Mixed Integer Linear Programming (MILP) as a benchmark. Furthermore, the proposed models are seeded using the Monte Carlo simulation technique by estimating the EVs arriving density to the EVS across the day. WCOA has shown an overall reduction of 13% and 8.5% in the total charging time while referring to MILP and GA respectively
Unsplittable Load Balancing in a Network of Charging Stations Under QoS Guarantees
The operation of the power grid is becoming more stressed, due to the
addition of new large loads represented by Electric Vehicles (EVs) and a more
intermittent supply due to the incorporation of renewable sources. As a
consequence, the coordination and control of projected EV demand in a network
of fast charging stations becomes a critical and challenging problem.
In this paper, we introduce a game theoretic based decentralized control
mechanism to alleviate negative impacts from the EV demand. The proposed
mechanism takes into consideration the non-uniform spatial distribution of EVs
that induces uneven power demand at each charging facility, and aims to: (i)
avoid straining grid resources by offering price incentives so that customers
accept being routed to less busy stations, (ii) maximize total revenue by
serving more customers with the same amount of grid resources, and (iii)
provide charging service to customers with a certain level of
Quality-of-Service (QoS), the latter defined as the long term customer blocking
probability. We examine three scenarios of increased complexity that gradually
approximate real world settings. The obtained results show that the proposed
framework leads to substantial performance improvements in terms of the
aforementioned goals, when compared to current state of affairs.Comment: Accepted for Publication in IEEE Transactions on Smart Gri
Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging
We introduce and study a general version of the fractional online knapsack problem with multiple knapsacks, heterogeneous constraints on which items can be assigned to which knapsack, and rate-limiting constraints on the assignment of items to knapsacks. This problem generalizes variations of the knapsack problem and of the one-way trading problem that have previously been treated separately, and additionally finds application to the real-time control of electric vehicle (EV) charging. We introduce a new algorithm that achieves a competitive ratio within an additive factor of one of the best achievable competitive ratios for the general problem and matches or improves upon the best-known competitive ratio for special cases in the knapsack and one-way trading literatures. Moreover, our analysis provides a novel approach to online algorithm design based on an instance-dependent primal-dual analysis that connects the identification of worst-case instances to the design of algorithms. Finally, we illustrate the proposed algorithm via trace-based experiments of EV charging
Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging
We introduce and study a general version of the fractional online knapsack problem with multiple knapsacks, heterogeneous constraints on which items can be assigned to which knapsack, and rate-limiting constraints on the assignment of items to knapsacks. This problem generalizes variations of the knapsack problem and of the one-way trading problem that have previously been treated separately, and additionally finds application to the real-time control of electric vehicle (EV) charging. We introduce a new algorithm that achieves a competitive ratio within an additive factor of one of the best achievable competitive ratios for the general problem and matches or improves upon the best-known competitive ratio for special cases in the knapsack and one-way trading literatures. Moreover, our analysis provides a novel approach to online algorithm design based on an instance-dependent primal-dual analysis that connects the identification of worst-case instances to the design of algorithms. Finally, we illustrate the proposed algorithm via trace-based experiments of EV charging
- …