Open AccessBased on Particle Group Algorithm of Route Planning for Transportable Charging Station
Author(s) -
Xiaoyin Ding,
Jun Zhou,
Jialun Cai,
Jing Zhang,
Taoyong Li,
Zhibin Liu,
Boqian Liu
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2025/1/012044
Subject(s) - motion planning , particle swarm optimization , path (computing) , mathematical optimization , shortest path problem , routing (electronic design automation) , selection (genetic algorithm) , computer science , any angle path planning , simulation , algorithm , engineering , mathematics , artificial intelligence , computer network , graph , theoretical computer science , robot
Aiming at the problem of path planning for transportable charging stations, a site selection model and path planning model for dedicated routes for transportable charging stations are proposed. The path planning problem model includes the vehicle path problem and the dynamic path problem, and the path planning model is emphatically studied. Considering the network optimization model of chargers and transportable charging station paths, by establishing a path planning model, setting parameters and models, using particle swarm algorithm to calculate the path planning model of chargers and mobile charging stations (Vehicle Routing Problem Considering Stationary and Movable Charging Points (referred to as “VRP-SMCP”) is solved, and the feasibility and effectiveness of the proposed model and algorithm is verified through comparative analysis of calculation examples, and the optimal path planning under the condition of minimizing cost is obtained.