The construction of fast charging networks lays the basis for the proliferation of electric vehicles (EVs). Most of the existing works on the charging station planning adopt the shortest path model to analyze EV load, failing to reflect the diverse path selection of drivers. In this paper, a fast charging station planning model based on K-shortest path algorithm is established. Firstly, according to the user’s travel demand, the K-shortest path algorithm is used to plan multiple travel paths, and the charging demand model and fast charging station planning constraints are developed. Secondly, with distribution network operation constraints considered, the joint planning model for the charging stations and distribution networks is formulated and then converted to a mixed integer linear programming (MILP) problem. Finally, the case studies on the modified Xi’an road networks have confirmed the necessity to take multiple shortest paths into account and verified the high-efficiency of the proposed method.
Joint Planning Method of Fast Charging Stations and Power Distribution Networks Based on K-Shortest Paths Algorithm
2023-11-28
1132687 byte
Conference paper
Electronic Resource
English
Shortest paths in traffic-light networks
Online Contents | 2000
|A New Algorithm for Shortest Paths in Discrete Dynamic Networks
British Library Conference Proceedings | 1997
|Shortest paths in randomly time varying networks
IEEE | 2001
|