PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
December 11, 2025Electronics2 citationsOpen Access

Joint Routing Optimization of Autonomous Vehicles Under Recharging and Battery-Swapping Modes

View Full Paper
ZCZhengying CaiRSRui ShenYCYu Chen

Key Points

  • To optimize the routing of autonomous vehicles for better recharging and battery-swapping efficiency.
  • Developed a multi-objective model to minimize distance and charging time.
  • Proposed an APC algorithm to tackle the NP-hard routing problem.
  • Conducted benchmark tests using real-world data from Wuhan.
  • APC algorithm outperformed baseline algorithms in routing efficiency.
  • Reduced total distance and waiting time for recharging.
  • Improved performance in accessing user demand arcs.

Abstract

Recharging and battery swapping are of great significance for extending the driving range of autonomous vehicles (AVs). However, if an AV cannot recharge or swap batteries in a timely manner, the consequences are more serious than for a traditional human-driven vehicle, as there is a lack of human assistance in an AV. To address this challenge, this study proposes the joint routing optimization of AVs under recharging and battery-swapping modes. Firstly, a multi-objective model is defined for the joint routing optimization problem of AVs, which minimizes the total distance, idling time, and charging waiting time of AVs while meeting all user demands. The user demand is described as a directed arc consisting of a departure node and a destination at random locations and times, and the AVs need to plan their routes to sequentially access all user demand arcs and recharge or swap batteries in a timely manner. Secondly, an improved artificial plant community (APC) algorithm is proposed to solve the NP-hard problem, including a recharging scheme and a hybrid scheme comprising recharging and swapping. In the seeding operation, random seeds are generated to enhance global search capabilities, and optimal solution learning is added in the fruiting operation to improve local search capabilities. In the growing operation, population optimization is strengthened to improve convergence performance. Thirdly, a benchmark test set was developed based on a real scenario in Wuhan, China. Compared to some baseline algorithms, the results show that the proposed APC algorithm exhibits better performance in solving the NP-hard problem.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Cai et al. (2025) studied this question.

synapsesocial.com/papers/69401b0d2d562116f28f70ebhttps://doi.org/10.3390/electronics14244880
Ask AI
Helpful
Bookmark
Share
View Full Paper