Charging station siting method based on variable neighborhood genetic algorithm

In recent years, the scale of the electric vehicle industry and social ownership are gradually growing, in the case that the charging facilities are not yet able to meet the demand for electric vehicle charging.Aiming at the situation described above, the research of charging station siting supported by variable neighborhood genetic algorithm is proposed.Based on the principle of charging station siting, the objective function and constraints are set, and the design of charging station siting model is realized.It is found that the traditional genetic algorithm, which has the problem of poor search ability, adopts the variable neighborhood genetic algorithm to solve the model.Calculated, this paper's algorithm in the charging demand peak period scenario, to determine the optimal charging station site selection there are four, the two objective function value of 0.94, 0.98, both in the charging peak period or the low peak period, this paper's method compared to the traditional genetic algorithm has a higher superiority.

Publication Details

Journal
Journal of Combinatorial Mathematics and Combinatorial Computing
Published
2025-04-16
DOI
https://doi.org/10.61091/jcmcc127b-016
Primary Topic
Advanced Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Charging station siting method based on variable neighborhood genetic algorithm

Journal of Combinatorial Mathematics and Combinatorial Computing
Advanced Algorithms and Applications
article

Charging station siting method based on variable neighborhood genetic algorithm

article en

Abstract

In recent years, the scale of the electric vehicle industry and social ownership are gradually growing, in the case that the charging facilities are not yet able to meet the demand for electric vehicle charging.Aiming at the situation described above, the research of charging station siting supported by variable neighborhood genetic algorithm is proposed.Based on the principle of charging station siting, the objective function and constraints are set, and the design of charging station siting model is realized.It is found that the traditional genetic algorithm, which has the problem of poor search ability, adopts the variable neighborhood genetic algorithm to solve the model.Calculated, this paper's algorithm in the charging demand peak period scenario, to determine the optimal charging station site selection there are four, the two objective function value of 0.94, 0.98, both in the charging peak period or the low peak period, this paper's method compared to the traditional genetic algorithm has a higher superiority.

Journal of Combinatorial Mathematics and Combinatorial ComputingVol. 127b
Openalex Percentile: Top 92%
Advanced Algorithms and Applications
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.