اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Fair Distribution of Power to Electric Vehicles: An Alternative to Pricing
83
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
As the popularity of electric vehicles increases, the demand for more power can increase more rapidly than our ability to install additional generating capacity. In the long term we expect that the supply and demand will become balanced. However, in the interim the rate at which electric vehicles can be deployed will depend on our ability to charge these vehicles without inconveniencing their owners. In this paper, we investigate using fairness mechanisms to distribute power to electric vehicles on a smart grid. We assume that during peak demand there is insufficient power to charge all the vehicles simultaneously. In each five minute interval of time we select a subset of the vehicles to charge, based upon information about the vehicles. We evaluate the selection mechanisms using published data on the current demand for electric power as a function of time of day, current driving habits for commuting, and the current rates at which electric vehicles can be charged on home outlets. We found that conventional selection strategies, such as first-come-first-served or round robin, may delay a significant fraction of the vehicles by more than two hours, even when the total available power over the course of a day is two or three times the power required by the vehicles. However, a selection mechanism that minimizes the maximum delay can reduce the delays to a few minutes, even when the capacity available for charging electric vehicles exceeds their requirements by as little as 5%.
قيم البحث
اقرأ أيضاً
Electric field induced nucleation is introduced as a possible mechanism to realize a metallic phase of hydrogen. Analytical expressions are derived for the nucleation probabilities of both thermal and quantum nucleation in terms of material parameter
s, temperature, and the applied field. Our results show that the insulator-metal transition can be driven by an electric field within a reasonable temperature range and at much lower pressures than the current paradigm of P > 400 GPa. Both static and oscillating fields are considered and practical implementations are discussed.
As an environment-friendly substitute for conventional fuel-powered vehicles, electric vehicles (EVs) and their components have been widely developed and deployed worldwide. The large-scale integration of EVs into power grid brings both challenges an
d opportunities to the system performance. On one hand, the load demand from EV charging imposes large impact on the stability and efficiency of power grid. On the other hand, EVs could potentially act as mobile energy storage systems to improve the power network performance, such as load flattening, fast frequency control, and facilitating renewable energy integration. Evidently, uncontrolled EV charging could lead to inefficient power network operation or even security issues. This spurs enormous research interests in designing charging coordination mechanisms. A key design challenge here lies in the lack of complete knowledge of events that occur in the future. Indeed, the amount of knowledge of future events significantly impacts the design of efficient charging control algorithms. This article focuses on introducing online EV charging scheduling techniques that deal with different degrees of uncertainty and randomness of future knowledge. Besides, we highlight the promising future research directions for EV charging control.
The growing use of electric vehicles (EVs) may hinder their integration into the electricity system as well as their efficient operation due to the intrinsic stochasticity associated with their driving patterns. In this work, we assume a profit-maxim
izer EV-aggregator who participates in the day-ahead electricity market. The aggregator accounts for the technical aspects of each individual EV and the uncertainty in its driving patterns. We propose a hierarchical optimization approach to represent the decision-making of this aggregator. The upper level models the profit-maximizer aggregators decisions on the EV-fleet operation, while a series of lower-level problems computes the worst-case EV availability profiles in terms of battery draining and energy exchange with the market. Then, this problem can be equivalently transformed into a mixed-integer linear single-level equivalent given the totally unimodular character of the constraint matrices of the lower-level problems and their convexity. Finally, we thoroughly analyze the benefits of the hierarchical model compared to the results from stochastic and deterministic models.
We pose the aggregators problem as a bilevel model, where the upper level minimizes the total operation costs of the fleet of EVs, while each lower level minimizes the energy available to each vehicle for transportation given a certain charging plan.
Thanks to the totally unimodular character of the constraint matrix in the lower-level problems, the model can be mathematically recast as a computationally efficient mixed-integer program that delivers charging schedules that are robust against the uncertain availability of the EVs. Finally, we use synthetic data from the National Household Travel Survey 2017 to analyze the behavior of the EV aggregator from both economic and technical viewpoints and compare it with the results from a deterministic approach.
We design a coordination mechanism for truck drivers that uses pricing-and-routing schemes that can help alleviate traffic congestion in a general transportation network. We consider the user heterogeneity in Value-Of-Time (VOT) by adopting a multi-c
lass model with stochastic Origin-Destination (OD) demands for the truck drivers. The main characteristic of the mechanism is that the coordinator asks the truck drivers to declare their desired OD pair and pick their individual VOT from a set of $N$ available options, and guarantees that the resulting pricing-and-routing scheme is Pareto-improving, i.e. every truck driver will be better-off compared to the User Equilibrium (UE) and that every truck driver will have an incentive to truthfully declare his/her VOT, while leading to a revenue-neutral (budget balanced) on average mechanism. This approach enables us to design personalized (VOT-based) pricing-and-routing schemes. We show that the Optimum Pricing Scheme (OPS) can be calculated by solving a nonconvex optimization problem. To improve computational efficiency, we propose an Approximately Optimum Pricing Scheme (AOPS) and prove that it satisfies the aforementioned properties. Both pricing-and-routing schemes are compared to the Congestion Pricing with Uniform Revenue Refunding (CPURR) scheme through extensive simulation experiments where it is shown that OPS and AOPS achieve a much lower expected total travel time and expected total monetary cost for the users compared to the CPURR scheme, without negatively affecting the rest of the network. These results demonstrate the efficiency of personalized (VOT-based) pricing-and-routing schemes.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
