Joint route and charging schedule optimization for electric vehicles considering nonlinear charging process using State-Space-Time networks

• Two key lemmas enable mapping between station selection and charging amount decisions. • A 3D SST network supports joint optimization of EV routes and charging schedules. • The model considers nonlinear charging and enables real-time re-planning of routes and charging schedules. Electric Vehicles (EVs) are increasingly integral to modern transportation systems for their environmental advantages. Effective EV route planning, especially for long-distance travel, must consider both charging station availability and vehicle range. However, existing studies are limited in providing exact solutions and real-time optimization, especially when considering nonlinear charging processes. This paper introduces a novel approach that simultaneously optimizes both EV routes and charging schedules, delivering exact solutions within seconds while accounting for the nonlinear charging behavior of EVs. The approach begins by approximating the nonlinear charging process using a piecewise linear function. With this approximation, the charging schedule optimization problem is formulated as a Mixed-Integer Programming (MIP) problem, aiming to maximize charging time efficiency along a fixed route. By analyzing the characteristics of the optimal charging schedule, we establish a mapping between charging station selection and optimal charging amount decisions. The joint optimization model is integrated with the route planning model through a State-Space-Time (SST) network. This allows simultaneous optimization of the time-efficient route and charging schedule by identifying a 3-dimensional route within the SST network. Energy consumption estimates during travel are incorporated to limit the number of charging events, further narrowing the search space. Finally, the real-world highway data are used for line and network simulations. The results of the line simulations demonstrate the model’s effectiveness in enhancing EV charging efficiency. Network simulations confirm that the joint model consistently identifies the optimal routes and charging schedules within seconds, proving its practicality and efficiency.

Authors

Institutions

Publication Details

Journal
Transportation Research Part E Logistics and Transportation Review
Published
2025-06-06
DOI
https://doi.org/10.1016/j.tre.2025.104233
Citations
1
Primary Topic
Electric Vehicles and Infrastructure
Type
article
Field-Weighted Citation Impact
0.73

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Joint route and charging schedule optimization for electric vehicles considering nonlinear charging process using State-Space-Time networks

Xiaobo Qu, Xu Zhigang, Jian‐Qiang Wang, Meng Zhang et al.
1 citations
Transportation Research Part E Logistics and Transportation Review
Electric Vehicles and Infrastructure
0.73
article

Joint route and charging schedule optimization for electric vehicles considering nonlinear charging process using State-Space-Time networks

Xiaobo Qu, Xu Zhigang, Jian‐Qiang Wang, Meng Zhang, Zhifang Xu, Ying Gao, Chenglin Liu
article en
1 citations

Abstract

• Two key lemmas enable mapping between station selection and charging amount decisions. • A 3D SST network supports joint optimization of EV routes and charging schedules. • The model considers nonlinear charging and enables real-time re-planning of routes and charging schedules. Electric Vehicles (EVs) are increasingly integral to modern transportation systems for their environmental advantages. Effective EV route planning, especially for long-distance travel, must consider both charging station availability and vehicle range. However, existing studies are limited in providing exact solutions and real-time optimization, especially when considering nonlinear charging processes. This paper introduces a novel approach that simultaneously optimizes both EV routes and charging schedules, delivering exact solutions within seconds while accounting for the nonlinear charging behavior of EVs. The approach begins by approximating the nonlinear charging process using a piecewise linear function. With this approximation, the charging schedule optimization problem is formulated as a Mixed-Integer Programming (MIP) problem, aiming to maximize charging time efficiency along a fixed route. By analyzing the characteristics of the optimal charging schedule, we establish a mapping between charging station selection and optimal charging amount decisions. The joint optimization model is integrated with the route planning model through a State-Space-Time (SST) network. This allows simultaneous optimization of the time-efficient route and charging schedule by identifying a 3-dimensional route within the SST network. Energy consumption estimates during travel are incorporated to limit the number of charging events, further narrowing the search space. Finally, the real-world highway data are used for line and network simulations. The results of the line simulations demonstrate the model’s effectiveness in enhancing EV charging efficiency. Network simulations confirm that the joint model consistently identifies the optimal routes and charging schedules within seconds, proving its practicality and efficiency.

Transportation Research Part E Logistics and Transportation ReviewVol. 201
Chang'an University (CN), Lanzhou Jiaotong University (CN), Tsinghua University (CN)
National Natural Science Foundation of China, Chang'an University, Fundamental Research Funds for the Central Universities, Natural Science Basic Research Program of Shaanxi Province
Openalex Percentile: Top 27%
Electric Vehicles and Infrastructure
0.73
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.