Dynamic Traffic Assignment for Electric Vehicles

by   Lukas Graf, et al.

We initiate the study of dynamic traffic assignment for electrical vehicles addressing the specific challenges such as range limitations and the possibility of battery recharge at predefined charging locations. We pose the dynamic equilibrium problem within the deterministic queueing model of Vickrey and as our main result, we establish the existence of an energy-feasible dynamic equilibrium. There are three key modeling-ingredients for obtaining this existence result: * We introduce a walk-based definition of dynamic traffic flows which allows for cyclic routing behavior as a result of recharging events en route. * We use abstract convex feasibility sets in an appropriate function space to model the energy-feasibility of used walks. * We introduce the concept of capacitated dynamic equilibrium walk-flows which generalize the former unrestricted dynamic equilibrium path-flows. Viewed in this framework, we show the existence of an energy-feasible dynamic equilibrium by applying an infinite dimensional variational inequality, which in turn requires a careful analysis of continuity properties of the network loading as a result of injecting flow into walks. We complement our theoretical results by a computational study in which we design a fixed-point algorithm computing energy-feasible dynamic equilibria. We apply the algorithm to standard real-world instances from the traffic assignment community illustrating the complex interplay of resulting travel times, energy consumption and prices paid at equilibrium.


page 1

page 2

page 3

page 4


A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows

Instantaneous dynamic equilibrium (IDE) is a standard game-theoretic con...

Side-Constrained Dynamic Traffic Equilibria

We study dynamic traffic assignment with side-constraints. We first give...

Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment

We study a dynamic traffic assignment model, where agents base their ins...

The Braess Paradox in Dynamic Traffic

The Braess's Paradox (BP) is the observation that adding one or more roa...

Global stability of day-to-day dynamics for schedule-based Markovian transit assignment with boarding queues

Schedule-based transit assignment describes congestion in public transpo...

Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time

We consider a dynamic model of traffic that has received a lot of attent...

A congested schedule-based dynamic transit passenger flow estimator using stop count data

A dynamic transit flow estimation model based on congested schedule-base...

Please sign up or login with your details

Forgot password? Click here to reset