> Detailanzeige

Baum, Moritz [Verfasser:in]; Dibbelt, Julian [Verfasser:in]; Hübschle-Schneider, Lorenz [Verfasser:in]; Pajor, Thomas [Verfasser:in]; Wagner, Dorothea [Verfasser:in] ; Moritz Baum and Julian Dibbelt and Lorenz Hübschle-Schneider and Thomas Pajor and Dorothea Wagner [Mitwirkende:r]

Speed-Consumption Tradeoff for Electric Vehicle Route Planning

Literatur-
verwaltung

Zur
Merkliste

Lösche von
Merkliste

Per Whatsapp teilen

Schließen

Merkliste



Sie können Bookmarks mittels Listen verwalten, loggen Sie sich dafür bitte in Ihr SLUB Benutzerkonto ein.
  • Medientyp: Sonstige Veröffentlichung; E-Artikel; Elektronischer Konferenzbericht
  • Titel: Speed-Consumption Tradeoff for Electric Vehicle Route Planning
  • Beteiligte: Baum, Moritz [Verfasser:in]; Dibbelt, Julian [Verfasser:in]; Hübschle-Schneider, Lorenz [Verfasser:in]; Pajor, Thomas [Verfasser:in]; Wagner, Dorothea [Verfasser:in]
  • Erschienen: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2014
  • Sprache: Englisch
  • DOI: https://doi.org/10.4230/OASIcs.ATMOS.2014.138
  • Schlagwörter: route planning ; bicriteria optimization ; algorithm engineering ; electric vehicles ; shortest paths
  • Entstehung:
  • Anmerkungen: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Beschreibung: We study the problem of computing routes for electric vehicles (EVs) in road networks. Since their battery capacity is limited, and consumed energy per distance increases with velocity, driving the fastest route is often not desirable and may even be infeasible. On the other hand, the energy-optimal route may be too conservative in that it contains unnecessary detours or simply takes too long. In this work, we propose to use multicriteria optimization to obtain Pareto sets of routes that trade energy consumption for speed. In particular, we exploit the fact that the same road segment can be driven at different speeds within reasonable intervals. As a result, we are able to provide routes with low energy consumption that still follow major roads, such as freeways. Unfortunately, the size of the resulting Pareto sets can be too large to be practical. We therefore also propose several nontrivial techniques that can be applied on-line at query time in order to speed up computation and filter insignificant solutions from the Pareto sets. Our extensive experimental study, which uses a real-world energy consumption model, reveals that we are able to compute diverse sets of alternative routes on continental networks that closely resemble the exact Pareto set in just under a second---several orders of magnitude faster than the exhaustive algorithm.
  • Zugangsstatus: Freier Zugang