اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدImpact of Electric Vehicle Routing with Stochastic Demand on Grid Operation
118
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Given the rise of electric vehicle (EV) adoption, supported by government policies and dropping technology prices, new challenges arise in the modeling and operation of electric transportation. In this paper, we present a model for solving the EV routing problem while accounting for real-life stochastic demand behavior. We present a mathematical formulation that minimizes travel time and energy costs of an EV fleet. The EV is represented by a battery energy consumption model. To adapt our formulation to real-life scenarios, customer pick-ups and drop-offs were modeled as stochastic parameters. A chance-constrained optimization model is proposed for addressing pick-ups and drop-offs uncertainties. Computational validation of the model is provided based on representative transportation scenarios. Results obtained showed a quick convergence of our model with verifiable solutions. Finally, the impact of electric vehicles charging is validated in Downtown Manhattan, New York by assessing the effect on the distribution grid.
قيم البحث
اقرأ أيضاً
As a foreseeable future mode of transport with lower emissions and higher efficiencies, electric vehicles have received worldwide attention. For convenient centralized management, taxis are considered as the fleet with electrification priority. In th
is work, we focus on the study on electric taxis dispatching, with consideration of picking up customers and recharging, based on real world traffic data of a large number of taxis in Beijing. First, the assumed electric taxi charging stations are located using the K mean method. Second, based on the station locations and the order demands, which are in form of origin-destination pairs and extracted from the trajectory data, a dispatching strategy as well as the simulation framework is developed with consideration of reducing customer waiting time, mitigating electric taxi charging congestion, and balancing order number distribution among electric taxis. The proposed method models the electric taxi charging behaviors temporally discretely from the aspects of charging demands and availability of chargers, and further incorporates a centralized and intelligent fleet dispatching platform, which is capable of handling taxi service requests and arranging electric taxis recharging in real time. The methodology in this paper is readily applicable to dispatching of different types of electric vehicle fleet with similar dataset available. Among the method, we use queueing theory to model the electric vehicle charging station waiting phenomena and include this factor into dispatching platform. Carbon emission is also surveyed and analyzed.
Deriving fast and effectively coordinated control actions remains a grand challenge affecting the secure and economic operation of todays large-scale power grid. This paper presents a novel artificial intelligence (AI) based methodology to achieve mu
lti-objective real-time power grid control for real-world implementation. State-of-the-art off-policy reinforcement learning (RL) algorithm, soft actor-critic (SAC) is adopted to train AI agents with multi-thread offline training and periodic online training for regulating voltages and transmission losses without violating thermal constraints of lines. A software prototype was developed and deployed in the control center of SGCC Jiangsu Electric Power Company that interacts with their Energy Management System (EMS) every 5 minutes. Massive numerical studies using actual power grid snapshots in the real-time environment verify the effectiveness of the proposed approach. Well-trained SAC agents can learn to provide effective and subsecond control actions in regulating voltage profiles and reducing transmission losses.
Logistics has gained great attentions with the prosperous development of commerce, which is often seen as the classic optimal vehicle routing problem. Meanwhile, electric vehicle (EV) has been widely used in logistic fleet to curb the emission of gre
en house gases in recent years. Solving the optimization problem of joint routing and charging of multiple EVs is in a urgent need, whose objective function includes charging time, charging cost, EVs travel time, usage fees of EV and revenue from serving customers. This joint problem is formulated as a mixed integer programming (MIP) problem, which, however, is NP-hard due to integer restrictions and bilinear terms from the coupling between routing and charging decisions. The main contribution of this paper lies at proposing an efficient two stage algorithm that can decompose the original MIP problem into two linear programming (LP) problems, by exploiting the exactness of LP relaxation and eliminating the coupled term. This algorithm can achieve a nearoptimal solution in polynomial time. In addition, another variant algorithm is proposed based on the two stage one, to further improve the quality of solution.
The Vehicle Fleet Sizing, Positioning and Routing Problem with Stochastic Customers (VFSPRP-SC) consists on pairing strategic decisions of depot positioning and fleet sizing with operational vehicle routing decisions while taking into account the inh
erent uncertainty of demand. We successfully solve the VFSPRP-SC with a methodology comprised of two main blocks: i) a scenario generation phase and ii) a two-stage stochastic program. For the first block, a set of scenarios is selected with a simulation-based approach that captures the behavior of the demand and allows us to come up with different solutions that could match different risk profiles. The second block is comprised of a facility location and allocation model and a Multi Depot Vehicle Routing Problem (MDVRP) assembled under a two-stage stochastic program. We propose several novel ideas within our methodology: problem specific cuts that serve as an approximation of the expected second stage costs as a function of first stage decisions; an activation paradigm that guides our main optimization procedure; and, a way of mapping feasible routes from one second-stage problem data into another; among others. We performed experiments for two cases: the first case considers the expected value of the demand, and the second case considers the right tail of the demand distribution, seeking a conservative solution. By using acceleration techniques we obtain solutions within 1 to 6 hours, reasonable times considering the strategic nature of the decision. For the ex-post evaluation, we solve 75% of the instances in less than 3 minutes, meaning that the methodology used to solve the MDVRP is well suited for daily operation.
The number of electric vehicles (EVs) is expected to increase. As a consequence, more EVs will need charging, potentially causing not only congestion at charging stations, but also in the distribution grid. Our goal is to illustrate how this gives ri
se to resource allocation and performance problems that are of interest to the Sigmetrics community.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
