License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2022.6
URN: urn:nbn:de:0030-drops-171104
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/17110/
Go to the corresponding OASIcs Volume Portal


Graf, Lukas ; Harks, Tobias ; Palkar, Prashant

Dynamic Traffic Assignment for Electric Vehicles

pdf-format:
OASIcs-ATMOS-2022-6.pdf (1 MB)


Abstract

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:
1) We introduce a walk-based definition of dynamic traffic flows which allows for cyclic routing behavior as a result of recharging events en route.
2) We use abstract convex feasibility sets in an appropriate function space to model the energy-feasibility of used walks.
3) 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.

BibTeX - Entry

@InProceedings{graf_et_al:OASIcs.ATMOS.2022.6,
  author =	{Graf, Lukas and Harks, Tobias and Palkar, Prashant},
  title =	{{Dynamic Traffic Assignment for Electric Vehicles}},
  booktitle =	{22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
  pages =	{6:1--6:15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-259-4},
  ISSN =	{2190-6807},
  year =	{2022},
  volume =	{106},
  editor =	{D'Emidio, Mattia and Lindner, Niels},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/17110},
  URN =		{urn:nbn:de:0030-drops-171104},
  doi =		{10.4230/OASIcs.ATMOS.2022.6},
  annote =	{Keywords: Electromobility, Dynamic Traffic Assignment, Dynamic Flows, Fixed Point Algorithm}
}

Keywords: Electromobility, Dynamic Traffic Assignment, Dynamic Flows, Fixed Point Algorithm
Collection: 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)
Issue Date: 2022
Date of publication: 06.09.2022
Supplementary Material: Software: https://github.com/ArbeitsgruppeTobiasHarks/electric-vehicles/tree/f6f67e45c70c3cd2b0690280be3591d044127747


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI