5,621 research outputs found
A binary symmetric based hybrid meta-heuristic method for solving mixed integer unit commitment problem integrating with significant plug-in electric vehicles
Conventional unit commitment is a mixed integer optimization problem and has long been a key issue for power system operators. The complexity of this problem has increased in recent years given the emergence of new participants such as large penetration of plug-in electric vehicles. In this paper, a new model is established for simultaneously considering the day-ahead hourly based power system scheduling and a significant number of plug-in electric vehicles charging and discharging behaviours. For solving the problem, a novel hybrid mixed coding meta-heuristic algorithm is proposed, where V-shape symmetric transfer functions based binary particle swarm optimization are employed. The impact of transfer functions utilised in binary optimization on solving unit commitment and plug-in electric vehicle integration are investigated in a 10 unit power system with 50,000 plug-in electric vehicles. In addition, two unidirectional modes including grid to vehicle and vehicle to grid, as well as a bi-directional mode combining plug-in electric vehicle charging and discharging are comparatively examined. The numerical results show that the novel symmetric transfer function based optimization algorithm demonstrates competitive performance in reducing the fossil fuel cost and increasing the scheduling flexibility of plug-in electric vehicles in three intelligent scheduling modes
Online mechanism design for electric vehicle charging
The rapid increase in the popularity of electric vehicles (EVs) and plug-in hybrid electric vehicles (PHEVs) is expected to place a considerable strain on the existing electricity grids, due to the high charging rates these vehicles require. In many places, the limited capacity of the local electricity distribution network will be exceeded if many such vehicles are plugged in and left to charge their batteries simultaneously. Thus, it will become increasingly important to schedule the charging of these vehicles, taking into account the vehicle ownersâ preferences, and the local constraints on the network. In this paper, we address this setting using online mechanism design and develop a mechanism that incentivises agents (representing vehicle owners) to truthfully reveal their preferences, as well as when the vehicle is available for charging. Existing related online mechanisms assume that agent preferences can be described by a single parameter. However, this is not appropriate for our setting since agents are interested in acquiring multiple units of electricity and can have different preferences for these units, depending on factors such as their expected travel distance. To this end, we extend the state of the art in online mechanism design to multi-valued domains, where agents have non-increasing marginal valuations for each subsequent unit of electricity. Interestingly, we show that, in these domains, the mechanism occasionally requires leaving electricity unallocated to ensure truthfulness. We formally prove that the proposed mechanism is dominant-strategy incentive compatible, and furthermore, we empirically evaluate our mechanism using data from a real-world trial of electric vehicles in the UK. We show that our approach outperforms any fixed price mechanism in terms of allocation efficiency, while performing only slightly worse than a standard scheduling heuristic, which assumes non-strategic agents
Comparison of intelligent charging algorithms for electric vehicles to reduce peak load and demand variability in a distribution grid
A potential breakthrough of the electrification of the vehicle fleet will incur a steep rise in the load on the electrical power grid. To avoid huge grid investments, coordinated charging of those vehicles is a must. In this paper, we assess algorithms to schedule charging of plug-in (hybrid) electric vehicles as to minimize the additional peak load they might cause. We first introduce two approaches, one based on a classical optimization approach using quadratic programming, and a second one, market based coordination, which is a multi-agent system that uses bidding on a virtual market to reach an equilibrium, price that matches demand and supply. We benchmark these two methods against each other, as well as to a baseline scenario of uncontrolled charging. Our simulation results covering a residential area with 63 households show that controlled charging reduces peak load, load variability, and deviations from the nominal grid voltage
Forecasting Recharging Demand to Integrate Electric Vehicle Fleets in Smart Grids
Electric vehicle fleets and smart grids are two growing technologies. These technologies
provided new possibilities to reduce pollution and increase energy efficiency.
In this sense, electric vehicles are used as mobile loads in the power grid. A distributed
charging prioritization methodology is proposed in this paper. The solution is based
on the concept of virtual power plants and the usage of evolutionary computation
algorithms. Additionally, the comparison of several evolutionary algorithms, genetic
algorithm, genetic algorithm with evolution control, particle swarm optimization, and
hybrid solution are shown in order to evaluate the proposed architecture. The proposed
solution is presented to prevent the overload of the power grid
Optimal Decentralized Protocols for Electric Vehicle Charging
We propose decentralized algorithms for optimally scheduling electric vehicle charging. The algorithms exploit the elasticity and controllability of electric vehicle related loads in order to fill the valleys in electric demand profile. We formulate a global optimization problem whose objective is to impose a generalized notion of valley-filling, study properties of the optimal charging profiles, and give decentralized offline and online algorithms to solve the problem. In each iteration of the proposed algorithms, electric vehicles choose their own charging profiles for the rest horizon according to the price profile broadcast by the utility, and the utility updates the price profile to guide their behavior. The offline algorithms are guaranteed to converge to optimal charging profiles irrespective of the specifications (e.g., maximum charging rate and deadline) of electric vehicles at the expense of a restrictive assumption that all electric vehicles are available for negotiation at the beginning of the planning horizon. The online algorithms relax this assumption by using a scalar prediction of future total charging demand at each time instance and yield near optimal charging profiles. The proposed algorithms need no coordination among the electric vehicles, hence their implementation requires low communication and computation capability. Simulation results are provided to support these results
Charging Scheduling of Electric Vehicles with Local Renewable Energy under Uncertain Electric Vehicle Arrival and Grid Power Price
In the paper, we consider delay-optimal charging scheduling of the electric
vehicles (EVs) at a charging station with multiple charge points. The charging
station is equipped with renewable energy generation devices and can also buy
energy from power grid. The uncertainty of the EV arrival, the intermittence of
the renewable energy, and the variation of the grid power price are taken into
account and described as independent Markov processes. Meanwhile, the charging
energy for each EV is random. The goal is to minimize the mean waiting time of
EVs under the long term constraint on the cost. We propose queue mapping to
convert the EV queue to the charge demand queue and prove the equivalence
between the minimization of the two queues' average length. Then we focus on
the minimization for the average length of the charge demand queue under long
term cost constraint. We propose a framework of Markov decision process (MDP)
to investigate this scheduling problem. The system state includes the charge
demand queue length, the charge demand arrival, the energy level in the storage
battery of the renewable energy, the renewable energy arrival, and the grid
power price. Additionally the number of charging demands and the allocated
energy from the storage battery compose the two-dimensional policy. We derive
two necessary conditions of the optimal policy. Moreover, we discuss the
reduction of the two-dimensional policy to be the number of charging demands
only. We give the sets of system states for which charging no demand and
charging as many demands as possible are optimal, respectively. Finally we
investigate the proposed radical policy and conservative policy numerically
- âŠ