Balancing Travel Time and Range Anxiety in Route Planning for Electric Vehicles

The rapid adoption of electric vehicles calls for efficient and specialized route planning solutions.Existing solutions focus primarily on minimizing travel time or the number of necessary stops for recharging.In particular, not much attention has been given to the "range anxiety problem," i.e., maximizing proximity to charging stations and maintaining a given minimal acceptable battery level.This paper presents a route planning approach that generates Pareto-optimal routes by considering both travel time and range anxiety.Our solution leverages a multi-objective version of the well-known A* algorithm in order to find diverse route options that reflect trade-offs between those two conflicting objectives.We show the viability of our approach by implementing it as a standalone web-based application using openly accessible datasets for road networks and charging stations. CCS Concepts Information systems Location based services.

Authors

Publication Details

Published
2025-08-25
DOI
https://doi.org/10.1145/3748777.3748799
Primary Topic
Advanced Battery Technologies Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Balancing Travel Time and Range Anxiety in Route Planning for Electric Vehicles

Mário A. Nascimento, Zongtan Li, Palkan Motwani
Advanced Battery Technologies Research
article

Balancing Travel Time and Range Anxiety in Route Planning for Electric Vehicles

Mário A. Nascimento, Zongtan Li, Palkan Motwani
article en

Abstract

The rapid adoption of electric vehicles calls for efficient and specialized route planning solutions.Existing solutions focus primarily on minimizing travel time or the number of necessary stops for recharging.In particular, not much attention has been given to the "range anxiety problem," i.e., maximizing proximity to charging stations and maintaining a given minimal acceptable battery level.This paper presents a route planning approach that generates Pareto-optimal routes by considering both travel time and range anxiety.Our solution leverages a multi-objective version of the well-known A* algorithm in order to find diverse route options that reflect trade-offs between those two conflicting objectives.We show the viability of our approach by implementing it as a standalone web-based application using openly accessible datasets for road networks and charging stations. CCS Concepts Information systems Location based services.

Openalex Percentile: Top 68%
Advanced Battery Technologies Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.