01632152

Component

https://doi.org/10.3141/2667-07

This paper formulates the problem of online charging and routing of a single electric vehicle in a network with stochastic and time-varying travel times. Public charging stations, with nonidentical electricity prices and charging rates, exist through the network. Upon arrival at each node, the traveler learns the travel time on all downstream arcs and the waiting time at the charging station, if one is available. The traveler aims to minimize the expected generalized cost—formulated as a weighted sum of travel time and charging cost—by considering the current state of the vehicle and availability of information in the future. The paper also discusses an offline algorithm by which all routing and charging decisions are made a priori. The numerical results demonstrate that cost savings of the online policy, compared with that for the offline algorithm, is more significant in larger networks and that the number of charging stations and vehicle efficiency rate have a significant impact on those savings.

01658386

17-02166

English

pp 61–70

2017

Transportation Research Record: Journal of the Transportation Research Board

9780309460446

Digital/other

Figures (4) ; References (27)

Decision making; Electric vehicle charging; Markov processes; Mathematical models; Routing; Stochastic processes

Energy; Highways; Planning and Forecasting; Vehicles and Equipment

TRIS, TRB, ATRI

Dec 8 2016 10:48AM

• Characterization of Trip-Level Pace Variability Based on Taxi GPS Trajectory Data
• Consistency Between Convergence of Dynamic Assignment and Stochasticity of Microsimulation: Implication for Number of Runs
• Effectiveness of Predictive Weather-Related Active Transportation and Demand Management Strategies for Network Management
• Estimating Path Travel Costs for Heterogeneous Users on Large-Scale Networks: Heuristic Approach to Integrated Activity-Based Model–Dynamic Traffic Assignment Models
• Estimation of Time-Varying Origin–Destination Patterns for Design of Multipath Progression on a Signalized Arterial
• Improved Calibration Method for Dynamic Traffic Assignment Models: Constrained Extended Kalman Filter
• Maximization of Platoon Formation Through Centralized Routing and Departure Time Coordination
• Monitoring Signalized Urban Networks: Dynamic Equilibrium-Free Model Based on a Discrete-Time Optimal Control Formulation
• Multiclass Traffic Assignment Problem with Flow-Dependent Passenger Car Equivalent Value of Trucks
• Multiclass, Multicriteria Dynamic Traffic Assignment with Path-Dependent Link Cost and Entropy-Based Risk Preference
• Reducing the Dimension of Online Calibration in Dynamic Traffic Assignment Systems
• Ridesharing User Equilibrium and Its Implications for High-Occupancy Toll Lane Pricing
• Solving the School Bus Routing Problem by Maximizing Trip Compatibility
• User and Operator Perspectives in Public Transport Timetable Synchronization Design