Route and Charging Planning for Electric Vehicles: A Multi-Objective Approach

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F25%3A00372684" target="_blank" >RIV/68407700:21230/25:00372684 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1080/19427867.2024.2315359" target="_blank" >https://doi.org/10.1080/19427867.2024.2315359</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1080/19427867.2024.2315359" target="_blank" >10.1080/19427867.2024.2315359</a>

Result language

angličtina

Original language name

Route and Charging Planning for Electric Vehicles: A Multi-Objective Approach

Original language description

Electric vehicle (EV) travel planning is a complex task that involves optimizing both the routes and the charging sessions for EVs. Existing algorithms for EV travel planning rely on single-objective optimization, which limits their ability to consider EV users' multiple and often conicting objectives, such as time and cost. In this paper, we introduce a new, genuinely multi-objective approach to EV travel planning, which can _nd Pareto sets containing multiple and possibly many EV travel plans optimized simultaneously for multiple objectives. We speci_cally focus on the bi-objective optimization for travel time and travel cost, which comprises the cost of EV charging as well as the vehicle wear and tear cost. To the best of our knowledge, our EV route and charging planning algorithm is the _rst one capable of performing such a genuine multi-objective optimization on realistically large country-scale problém instances involving more than 12 000 charging stations. We implemented our approach into a fully operational prototype application and extensively evaluated it on real-world data for the whole of Germany. Our results show that our approach can achieve practically usable planning times with only a minor loss of solution quality, despite the very high computational complexity of the multi-objective EV travel planning problem.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2025

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Transportation Letters

ISSN

1942-7867

e-ISSN

1942-7875

Volume of the periodical

17

Issue of the periodical within the volume

1

Country of publishing house

GB - UNITED KINGDOM

Number of pages

21

Pages from-to

1-21

UT code for WoS article

001201888300001

EID of the result in the Scopus database

2-s2.0-85190756004