Private mobility electrification is slowed down by technical limitations, such as the low autonomy of electric vehicles (EVs) compared to internal combustion engine vehicles (ICEVs). As a consequence, accurate planning of the route is needed before a travel with an EV begins. Routing algorithms are of crucial importance to identify the route which allows to minimize total travel time, reducing the drawbacks of battery’s limited energy density. The complexity of the problem and the size of road networks considered for this task imply computational times which are not in line with users’ needs. The method proposed in this article employs clustering and pruning techniques to speed up planning by downsizing the network analyzed during route planning. By reducing the computational cost, it is possible to apply Dijkstra algorithm, which provides an exact minimization of total travel time.

Cluster-based route planning for electric vehicles travel time optimization / Ponso, Alberto; Bonfitto, Angelo. - In: INTERNATIONAL JOURNAL OF SUSTAINABLE TRANSPORTATION. - ISSN 1556-8318. - (2025), pp. 1-20. [10.1080/15568318.2025.2474029]

Cluster-based route planning for electric vehicles travel time optimization

Ponso, Alberto;Bonfitto, Angelo
2025

Abstract

Private mobility electrification is slowed down by technical limitations, such as the low autonomy of electric vehicles (EVs) compared to internal combustion engine vehicles (ICEVs). As a consequence, accurate planning of the route is needed before a travel with an EV begins. Routing algorithms are of crucial importance to identify the route which allows to minimize total travel time, reducing the drawbacks of battery’s limited energy density. The complexity of the problem and the size of road networks considered for this task imply computational times which are not in line with users’ needs. The method proposed in this article employs clustering and pruning techniques to speed up planning by downsizing the network analyzed during route planning. By reducing the computational cost, it is possible to apply Dijkstra algorithm, which provides an exact minimization of total travel time.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2998265
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo