The Electric Car-Sharing Relocation and Recharging Problem Considering Route Balancing
- 1College of Information Science and Engineering, Northeastern University, Shenyang 110819, China
Abstract
One-way station-based electric car-sharing systems frequently develop spatial stock imbalances and charging shortfalls. Although operator staff are the primary corrective mechanism to relocate surplus electric cars (ECs) and ferry low-energy ECs to charger-equipped stations, most planning models optimize only the logistics cost or profit while leaving staff workload largely unregulated. This study addresses the electric car-sharing relocation problem considering route balancing, which jointly minimizes relocation distance cost and aggregate duty time while limiting the spreads between the longest and shortest duties and driven distances, subject to residual range limits, shift caps, and sparse charging coverage. The problem is formulated as a nonlinear multi-criterion mixed-integer programming model and, after replacing the extreme-duty terms with linear equivalents, weighted scalarization yields a single-objective mixed-integer linear programming. A request-oriented adaptive large neighborhood search (ALNS) is developed with specialized removal and insertion operators, including a fairness-aware inserter, adaptive operator weights, and simulated annealing-based acceptance. Computational experiments on 21 instances show that ALNS improves CPLEX incumbents by 5.8–6.1% on large cases in 1.5–1.8 s of CPU time (versus a 3600 s limit), exceeds GA by 1.0% on average under equal 30 s budgets, and that the explicit implementation of route equity weights measurably reshapes staff tours without sacrificing operational feasibility.
Related
- Climate Cooperation and Spatial Industrial Relocation: Stability, Emissions, and Regional Policy Incentives
- Statistical damage model of rock considering pore water pressure and multifractal characteristics
- A third-medium approach for electro-thermo-mechanical contact considering Joule heating
- Research on expressway traffic accident risk prediction method considering Spatio-Temporal effects
- Three-Phase Unbalance Mitigation via DSO-FRA Coordination: A GNB-Based Chance-Constrained Model Considering PV Uncertainty
BibTeX
@article{wang2026electric,
title = {{The Electric Car-Sharing Relocation and Recharging Problem Considering Route Balancing}},
author = {Zhaoming Wang and Ruiyou Zhang},
journal = {Mathematics},
year = {2026},
month = oct,
doi = {10.3390/math14203740},
url = {https://www.mdpi.com/2227-7390/14/20/3740},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - The Electric Car-Sharing Relocation and Recharging Problem Considering Route Balancing
AU - Zhaoming Wang
AU - Ruiyou Zhang
PY - 2026
DA - 2026/10/14
JO - Mathematics
DO - 10.3390/math14203740
UR - https://www.mdpi.com/2227-7390/14/20/3740
AB - One-way station-based electric car-sharing systems frequently develop spatial stock imbalances and charging shortfalls. Although operator staff are the primary corrective mechanism to relocate surplus electric cars (ECs) and ferry low-energy ECs to charger-equipped stations, most planning models optimize only the logistics cost or profit while leaving staff workload largely unregulated. This study addresses the electric car-sharing relocation problem considering route balancing, which jointly minimizes relocation distance cost and aggregate duty time while limiting the spreads between the longest and shortest duties and driven distances, subject to residual range limits, shift caps, and sparse charging coverage. The problem is formulated as a nonlinear multi-criterion mixed-integer programming model and, after replacing the extreme-duty terms with linear equivalents, weighted scalarization yields a single-objective mixed-integer linear programming. A request-oriented adaptive large neighborhood search (ALNS) is developed with specialized removal and insertion operators, including a fairness-aware inserter, adaptive operator weights, and simulated annealing-based acceptance. Computational experiments on 21 instances show that ALNS improves CPLEX incumbents by 5.8–6.1% on large cases in 1.5–1.8 s of CPU time (versus a 3600 s limit), exceeds GA by 1.0% on average under equal 30 s budgets, and that the explicit implementation of route equity weights measurably reshapes staff tours without sacrificing operational feasibility.
SN - 2227-7390
ER -