1
Location Analysis of Electric Vehicle Charging
Station Based on Improved PSO
Dinghao Liu∗§ , Huajun Zhang∗ , Hongwei Nie† ,Yibo Zhao∗
∗ School
of Automation, Wuhan University of Technology, Wuhan 430070, China
† Simulation Center, China Nuclear Power Operation Technology Cooperation Ltd., Wuhan 430223, China
§ Corresponding author
Abstract—Aiming at the problem of site selection for electric
vehicle charging station, a comprehensive optimization objective
function considering construction cost and running cost was
established. Based on the operating costs such as land cost,
construction cost and power loss, and the traffic convenience of
users, the objective function comprehensively and scientifically
reflects the essence of electric vehicle charging station location.
The location of electric vehicle charging station is a multi-
objective, multi-constrained and nonlinear optimization problem.
On the basis of determining the objective function, the dynamic
adaptive adaptive inertia weight coefficient and improved particle
swarm optimization with random particle individual are pro-
posed. The algorithm solves this problem and reasonably avoids
the disadvantage that the particle swarm algorithm is easy to
fall into the local optimal solution. Using this algorithm and the
optimized model, the electric vehicle charging station in a certain
area is planned. The comparison analysis shows that the method
is feasible and effective.
Keywords—electric vehicle charging station; location; particle
swarm optimization; inertia weight coefficient.
I. I NTRODUCTION
With the depletion of fossil energy and the increasingly
severe environmental problems, energy conservation and emis-
sion reduction have become the focus of attention around the
world. New energy vehicles have ushered in the best period
of development, and the promotion of electric vehicles is the
development of new energy vehicles in the future. The main
direction, the economical and fast charging network is the
premise of the popularity of electric vehicles. The location
planning of electric vehicle charging station [1] is an important
part of the entire electric vehicle charging network planning.
To determine a reasonable charging network structure, the
location of the charging station must be determined first, so
that the charging grid construction cost, operating cost and
The transportation convenience is the smallest.
The location of the electric vehicle charging station is a
multi-objective optimization problem, which has the char-
acteristics of multi-objective, multi-constraint and nonlinear.
At present, the commonly used multi-objective optimiza-
tion algorithms include geometric weighting method, multi-
objective programming method, multi-objective differential
evolution algorithm, multi-objective genetic algorithm and so
on. However, the above several algorithms have problems of
low computational efficiency and slow convergence speed in
the solution process.
978-1-7281-1312-8/18/$31.00 ©2018 IEEE 2184
The particle swarm optimization algorithm [2] is a group
intelligence algorithm. The particle swarm optimization algo-
rithm is inspired by the bird’s search for food as a biological
population behavior feature and used to solve the optimization
problem. In the particle swarm optimization algorithm, each
particle Representing a potential solution to the problem,
each particle corresponds to a fitness value determined by a
fitness function. The velocity of the particle determines the
direction and distance of the particle movement. The velocity
is dynamically adjusted with the movement experience of
other particles, so that the individual can be optimized in
the solvable space. The particles in the group are effectively
obtained according to their own experience and experience of
other particles. Information to guide the search. The particle
swarm optimization algorithm uses high-efficiency clusters
to search non-inferior solutions in parallel, and can generate
multiple non-inferior solutions in each iteration. At the same
time, the particle swarm optimization algorithm has memory
function, and the particles track their own historical optimal
solutions and population globals. The optimal solution is used
for searching, which makes the particle swarm optimization
algorithm have good convergence and global search ability
in the optimization process. Moreover, the particle swarm
algorithm does not have any special requirements for the
optimization function (such as differentiation, time continuity,
etc.), and has strong versatility, which has unique advantages
for multivariable and highly nonlinear situations. Therefore,
the particle swarm optimization algorithm is used to solve
the substation location problem. However, it is easy to fall
into local optimum due to the particle swarm optimization
algorithm. In order to overcome the defect of local conver-
gence of particle swarm optimization algorithm, this paper
improves the basic particle swarm optimization algorithm to
a certain extent, and adopts the strategy of linear decreasing
of inertia weight to overcome the shortcomings of common
particle swarm optimization algorithm which is easy to fall
into local optimum.
In this paper, the multi-objective optimization model of
charging station location is established firstly, and some
problems in the multi-objective particle swarm optimization
algorithm are improved. An improved multi-objective particle
swarm optimization algorithm is proposed. Finally, the simu-
lation analysis is carried out with examples, the validity of the
verification method.

II. M ATHEMATICAL MODEL BUILDING
Before solving the location planning problem of the charg-
ing station, firstly, the mathematical model of the charging sta-
tion location planning problem should be established. First, the
charging demand cell is divided in the planned charging area,
and the number of electric vehicles in each cell is counted,
and each will be The charging needs of the community are
set at the geometric center [3]. Due to the limitation of the
land parcel, the appropriate alternative station address can only
be selected through field investigation. Finally, the improved
model is used to calculate the established model, and the best
website address is selected in the alternative address. [4]
A. Charging cost objective function
The layout planning of the electric vehicle charging station
needs to consider saving the charging cost as much as possible.
At present, the charging cost objective function aiming at
minimizing the annual comprehensive cost of the charging
station is reasonable. Therefore, it is necessary to consider
the three types of costs of investment fixed cost, operating
cost and one-year charging cost of the charging station, and
the annual comprehensive cost of the charging station is the
sum of the above three kinds of costs. The objective function
of its specific charging cost is as follows:
min Z = Z1 + Z2 + Z3
m  n 
r (1 + r)
Z1 = F n
j=1
(1 + r) − 1

m
Z2 = F (1 + α)
j=1
⎡ ⎛ ⎞  ⎤
  required. After normalizing the data of equations (1) and (6)
Z3 = 365k ⎣ηt ⎝ gij ni Dij ⎠ − pWi ⎦ × 10−4
i∈I j∈J i∈I
n Z
r (1 + r)
γ= n (5)
(1 + r) − 1
Among them, Z is the cost of charging, and Z1 is the
fixed cost of investment. F is the cost of purchasing land,
transformers, chargers and other equipment, m is the number
of charging stations, n is the operating period of the charging
station, r is the investment recovery rate, γ is the annual cost
conversion factor; Z2 is the charging station operating cost,
including maintenance costs , material, personnel salary, etc.,
α is the conversion factor; Z3 is the annual charging cost, k
is the average number of times of charging per vehicle per
day, η is the tortuosity coefficient of the road, t is the cost
per kilometer of the car, and I is the charging demand point.
The set, J is the collection of charging stations, gij is whether
the demand point i is charged to the charging station j (1 is
charged to j, otherwise 0), ni is the number of cars to be
charged at the demand point i, Dij is the point i The linear
distance to the charging station j, p is the profit amount per
kWh, and Wi is the average daily charging demand of all users
to the charging demand point.
2
B. Traffic convenience objective function
The layout planning of the electric vehicle charging station
needs to consider the convenience of the user as much as
possible, that is, the average distance that the charging car user
of each charging demand point is charged to the corresponding
charging station should be as small as possible. In fact, because
the road conditions are not the same, the distance traveled by
the charging car users at each charging demand point to the
corresponding charging station will not be exactly equal, but
the difference in form distance is limited because the position
is relatively fixed. Therefore, the traffic convenience objective
function aiming at minimizing the average linear distance
of the charging vehicle user to the corresponding charging
station charging at each charging demand point is reasonable.
The objective function of its specific traffic convenience is as
follows:  
gij ni Dij
i∈I j∈J
min L =  (6)
ni
i∈I
Where L is the average distance that the charging car
user charges to the corresponding charging station for each
charging demand point.
C. Double optimization index objective function
(1) In fact, the layout planning of electric vehicle charging
stations should take into account two optimization indicators
(2) of charging cost and transportation convenience. Since the
dimension and magnitude of the distance between the charging
cost Z and the charging average distance L are different, in
(3) order to eliminate the influence of the difference between
the dimension and the magnitude of the optimization target
on the optimization result, data normalization processing is
and linearly weighting, the objective function finally adopted
by the optimization algorithm can be obtained, as follows:
(4)
L
min v = α1 × + α2 × (7)
ZU L LU L
Where v is the final objective function value, ZU L is an
upper limit of the charging cost, LU L is an upper limit of the
charging average distance, and α1 , α2 are the corresponding
weights.
D. constraints
In fact, considering the actual situation, such as the lim-
itation of charging station capacity and charging radius, the
mathematical model of the optimal planning problem of elec-
tric vehicle charging station layout needs to add the following
constraints.
m
gij = 1 (8)
j=1
Dij < Rj (9)

Pi ≤ Sj e (Sj ) cos (φj ) (10)
i∈I
2185
 3

 
Q specific particle swarm optimization algorithm that introduces
a < f ix +1 (11)
Sj the inertia weight coefficient ω is an iterative calculation
Wherein, the constraint (8) indicates that the charging car formula as described in the following formula (14).
is charged only to one charging station; the constraint (9)
indicates that the distance from the charging car to the
d
vi,t+1 = ωi,t
d
∗ vi,t
d
+ c1 ∗ rand ∗ (pdi,t − xdi,t )
charging station must be less than the charging radius; the +c2 ∗ rand ∗ (pdg,t − xdi,t )
constraint (10) indicates that the capacity of the charging
xdi,t+1 = xdi,t + vi,t+1
d
(14)
station is greater than the charging to the charging station.
The total required load of the electric vehicle, Constraint (11)
indicates that the number of charging stations to be built is Although the complexity of the improved algorithm is
equal to the total charge demand Q of all cars charged to the not much increased compared to the initial algorithm, the
charging station every day divided by the capacity of each performance has been greatly improved and is widely used.
charging station and then incremented by one.

A. Linear Decreasing Weight PSO

E. Constraint target model
For any constrained target model, the optimal approximate The inertia weight ω plays an important role in whether the
solution can be solved by using the optimization algorithm. For particle swarm algorithm can converge. It keeps the particle
the optimal planning problem of the electric vehicle charging inertia, which makes it have the tendency to expand the search
station layout, the constraint conditions are relatively fixed. space and has the ability to explore new regions. Appropriate
According to the actual needs, different target functions can inertia weight values play a coordinating role in search ac-
be selected to form different constraint target models. The curacy and search speed [5]. Based on the characteristics of
constraint target model for its optimization problem is as the important parameter ω of the particle swarm optimization
follows: algorithm, the particle swarm optimization algorithm is mainly
⎧ used to accelerate the convergence speed in the initial stage
⎨ min {F (x)}
of population evolution. At the end stage of population evo-
s.t. g(x) ≤ 0, i = 1, 2, · · · , m (12)
⎩ lution, the particle swarm optimization algorithm is used to
x = (x1 , x2 , · · · , xn ), x ∈ Ω
determine the exact solution. Therefore, the researchers have
Where F (x) is the objective function; g(x) is the cor- proposed dynamic inertia weights such as inertia weight linear
responding inequality constraint or equality constraint; x is decrement (LDW) strategy [6], fuzzy selection inertia weight
the decision variable, ie the sequence of alternative charging (FW) [7], [8] strategy and random selection inertia weight
stations selected by all charging demand cells. (RW) strategy [9]. Adaptive particle swarm optimization.
Among them, the linear regression strategy of inertia weight
III. I MPROVED PARTICLE SWARM OPTIMIZATION is a more mature optimization strategy of particle swarm
optimization.
The particle swarm optimization algorithm was jointly
proposed by American psychologist Kennedy and electrical The linear decrement (LDW) particle swarm optimization
engineer Eberhart in 1995 by the bird’s foraging behavior. algorithm of inertia weight, that is, the entire search process,
The basic principle of particle swarm optimization is derived the inertia weight decreases linearly with the population evo-
from the simulation of predation behavior of birds. The basic lution algebra [10]. The relationship between the evolutionary
particle swarm optimization algorithm updates the iterative algebra t of the specific inertia weight ω is shown in Figure 1.
calculation formula as described in the following formula (13). The specific iterative calculation formula of the particle swarm
d
vi,t+1 = vi,t
d
+ c1 ∗ rand ∗ (pdi,t − xdi,t )
+ c2 ∗ rand ∗ (pdg,t − xdi,t )
xdi,t+1 = xdi,t + vi,t+1
d
(13)
i = 1, 2, · · · , N indicates the serial number of the particle,
t represents the t-dimension of the particle, d indicates the
number of iterations, c1 , c2 is the acceleration constant, Gen-
erally, the value is between 0 and 2, and rand is the random
real number of the interval (0, 1).
However, the particle swarm optimization algorithm is
easy to fall into local optimum. In order to overcome the
shortcomings of the local convergence of the particle swarm
optimization algorithm, many literatures have improved the
basic particle swarm optimization algorithm to a certain ex-
tent. One of the important literature improvement measures Fig. 1. Relationship between inertia weight ω and population number t under
is proposed based on the inertia weight coefficient ω. The LDW strategy

2186
 4

optimization algorithm that introduces the inertia weight co- of the particle swarm optimization algorithm is based on
efficient ω is as described in the following formula (1). the following formula (17).
d
vi,t+1 = ωi,t
d
∗ vi,t
d
+ c1 ∗ rand ∗ (pdi,t − xdi,t )
d
vi,t+1 = ωi,t
d
∗ vi,t
d
+ c1 ∗ rand ∗ (pdi,t − xdi,t )
+c2 ∗ rand ∗ (pdg,t − xdi,t )
+ c2 ∗ rand ∗ (pdg,t − xdi,t )
xdi,t+1 = xdi,t + vi,t+1
d
xdi,t+1 = xdi,t + d
vi,t+1 v d
ωi,t = (ωmax − ωk ∗ t) ∗ r + At
d
ωi,t = ωmax − ωk ∗ t (15)
At ∈ {0, 0.1} (17)

Where ωmax is the initial maximum inertia weight and ωk 2) Introduce random individuals to maintain particle swarm
is the decreasing slope of the inertia weight coefficient. diversity. According to the update method of particle
swarm update, the particle swarm algorithm makes all
individuals close to the optimal particles in the iterative
process, causing the particle group particles to aggregate
B. Improved strategy of particle swarm optimization and lose diversity. At a probability of 25%, a random
individual in the solution space is replaced with the
The LDW strategy can significantly improve the optimiza- particle obtained by the particle swarm algorithm. In
tion performance of PSO [5]. ]However, PSO is nonlinear and general, the introduction of random individuals with
highly complex in the actual search process, and the strategy a small probability does not affect the actual iterative
of linearly decreasing the inertia weight ω cannot reflect the calculation trend of the particle swarm algorithm.
actual optimized search process, which leads to certain limita-
tions on the improvement of the optimization effect. Therefore, IV. E XAMPLES A NALYSIS
in the implementation of the particle swarm algorithm, when
The electric vehicle charging area in a certain area can be
the algorithm is delayed and the better current optimal solution
divided into 20 electric vehicle charging demand communities
is not available, a certain amount of constant perturbation is
according to the nature of land use and roads. The central co-
added, so that the inertia weight ω suddenly increases at a
ordinates and electric vehicle ownership are shown in Table I.
certain iteration, so as to facilitate Jump out of the local search
Assume that the number of electric vehicles is constant during
and perform a global search to prevent local convergence. For
the planning of the charging station, and that each vehicle
the LDW particle swarm optimization algorithm that increases
is charged once every two days. After actual investigation, it
the inertia weight of the disturbance, the particlelet group
is found that there are ten locations that can be selected as
algorithm with the inertia weight coefficient ω is updated to
charging station construction sites. It is planned to build five
calculate the iterative calculation formula as described in the
charging stations within the planning area. See Table II for
following formula (16).
candidate sites.
d
vi,t+1 = ωi,t
d
∗ vi,t
d
+ c1 ∗ rand ∗ (pdi,t − xdi,t ) TABLE I
C ENTER COORDINATES AND POSSESSION
+c2 ∗ rand ∗ (pdg,t − xdi,t )
xdi,t+1 = xdi,t + vi,t+1
d
No. coordinate possession
d
ωi,t = ωmax − ωk ∗ t + At 1 (23.0, 12.1) 130
2 (20.4, 30.1) 128
At ∈ {0, 0.1} (16) 3 (20.6, 10.8) 123
4 (19.3, −31.4) 100
5 (11.1, 34.4) 120
Where At is the inertia weight perturbation constant, under 6 (12.4, −30.8) 108
7 (−14.3, 20.8) 114
a certain perturbation probability, At = 0.1, the rest, At = 0. 8 (−16.4, −14.4) 130
The probability of perturbation in this paper is 0.1. 9 (1.9, 34.1) 106
Despite the LDW strategy, particles tend to accumulate 10 (8.5, −23.0) 121
11 (−4.4, 39.2) 105
around the optimal particles, causing particle aggregation. In 12 (0.8, −34.2) 79
order to overcome the above shortcomings, based on the above 13 (−12.4, −17.3) 75
improvement strategies, this paper proposes the following two 14 (−5.3, −15.9) 120
15 (−7.5, −31.5) 123
improvement methods: 16 (−2.4, 7.4) 237
17 (−1.4, −2.8) 118
1) Dynamically adaptive change of inertia weighting factor. 18 (−7.3, 17.3) 100
At a probability of 35%, the inertia weight obtained 19 (8.4, −13.6) 108
by the inertia weight linear decrement (LDW) particle 20 (−5.6, 19.5) 112
swarm optimization algorithm that increases the pertur-
bation is multiplied by a coefficient in a fixed range. First, using the ordinary particle swarm optimization algo-
The coefficient is in the range of 0.9-1.1. The specific rithm for site selection analysis, the site and service range
dynamic adaptive change of the inertia weight coefficient of the selected charging station can be obtained, as shown

2187
 5

TABLE II algorithm and planning the location of the electric vehicle

C ANDIDATE S ITES AND C OORDINATES charging station in a certain place, the following conclusions
are drawn:
No. coordinate No. coordinate
1) The improved particle swarm optimization algorithm
1 (−5.5, 28.4) 6 (7.2, 18.4)
2 (−2.4, 33.6) 7 (7.5, −12.1) can obtain a better decision-making scheme. Compared
3 (−6.3, −24.2) 8 (−1.1, −11.1) with the common particle swarm optimization algorithm,
4 (16.3, 31.5) 9 (−14.7, 14.5) the optimization efficiency and performance have been
5 (18.1, −25.5) 10 (18.4, 13.8)
improved.
2) In the mathematical model proposed in this paper, not
only the construction cost of the charging station is
in Table III. At the same time, the cost of establishing a
considered, but also the operating cost considers the
charging station to the scheme is 66.381 million yuan, and
convenient transportation convenience of the user, which
the average distance charged by the charging vehicle user to
scientifically and comprehensively reflects the essence
the corresponding charging station is 13.51 kilometers. After
of the problem of the location of the electric vehicle
normalized linear weighting, the obtained function value is
charging station.
0.6678. Table III Site and service scope by PSO.
Through the calculation and analysis of the example, it is
proved that the optimization calculation model proposed
TABLE III
S ITE AND SERVICE SCOPE BY PSO in this paper is scientific and feasible.

site coordinate Service Ownership ACKNOWLEDGMENT

4 (16.3, 31.5) 2,9,19 342 Thanks for the support of the foundation of MIIT, China,
5 (18.1, −25.5) 3,4,6,12,16 1223
6 (7.2, 18.4) 5,14,18 370
No. [2017]614.
8 (−1.1. − 11.1) 1,8,10,11,13,15 684
9 (−14.7, 14.5) 7,17,20 344 R EFERENCES
[1] M. F. Shaaban, A. A. Eajal, and E. F. El-Saadany, “Coordinated charging
Next, using the improved particle swarm optimization al- of plug-in hybrid electric vehicles in smart hybrid ac/dc distribution
gorithm for site selection analysis, the site and service range systems,” Renewable Energy, vol. 82, pp. 92–99, 2015.
[2] J. Zhang, A. Zhou, K. Tang, and G. Zhang, “Preselection via classifica-
of the selected charging station can be obtained, as shown tion: A case study on evolutionary multiobjective optimization,” 2017.
in Table III. At the same time, the cost of establishing a [3] W. Yang and Q. Li, “Survey on particle swarm optimization algorithm,”
charging station to the scheme is 54.479 million yuan, and Engineering Science, vol. 6, no. 5, pp. 87–94, 2004.
[4] T. Chen, Z. N. Wei, W. U. Shuang, G. Q. Sun, Y. F. Wei, and X. U. Xiao-
the average distance charged by the charging vehicle user to Hui, “Distribution network planning by considering siting and sizing of
the corresponding charging station is 10.84 kilometers. After electric vehicle charging stations,” Proceedings of the Chinese Society
normalized linear weighting, the obtained function value is of Universities for Electric Power System and Its Automation, 2013.
[5] F. Pan, L. I. Xiao-Ting, Q. Zhou, L. I. Wei-Xing, Q. Gao, F. Pan, L. I.
0.5268. Xiao-Ting, Q. Zhou, L. I. Wei-Xing, and Q. Gao, “Analysis of standard
particle swarm optimization algorithm based on markov chain,” Acta
TABLE IV Automatica Sinica, vol. 39, no. 4, pp. 381–389, 2013.
S ITE AND SERVICE SCOPE BY IMPROVED PSO [6] J. Feng and S. Liu, “An improved generalized newton method for
absolute value equations,” Springerplus, vol. 5, no. 1, pp. 1–10, 2016.
site coordinate Service Ownership [7] FuqingZhao, JianxinTang, JunbiaoWang, and JonrinaldiJonrinaldi, “An
improved particle swarm optimisation with a linearly decreasing distur-
4 (−6.3, −24.2) 2,5,6,7 470 bance term for flow shop scheduling with limited buffers,” International
6 (16.3, 31.5) 8,13,14 ,18 425 Journal of Computer Integrated Manufacturing, vol. 27, no. 5, pp. 488–
7 (18.1, −25.5) 1,16,17,19 593 499, 2014.
9 (7.2, 18.4) 3,4,9, 20 441 [8] X. Heming, “Research on multi-objective particle swarm optimization
1 (−1.1. − 11.1) 10,11,12,15 428 algorithm,” Shanghai Jiaotong University, 2013.
[9] Y. Shi and R. Eberhart, “Fuzzy adaptive particle swarm optimization,”
in Proceedings of the IEEE International Congress on Evolutionary
The case study shows that the improved particle swarm Computation, 2001.
optimization algorithm can accurately derive the scheme with [10] J. Bai, G. Yin, and Z. Sun, “A random weighted hybrid particle swarm
optimization algorithm based on second order oscillation and natural
better economy and convenience. The electric vehicle charging selection,” Control and Decision, vol. 27, no. 10, pp. 1459–1464, 2012.
station location model and the proposed optimization algo-
rithm are used to charge the electric vehicle. The planning
work of the station has a good auxiliary decision-making role.

V. C ONCLUSION
In this paper, a comprehensive and comprehensive location
selection model for electric vehicle charging stations is estab-
lished with the goal of minimizing the construction cost, oper-
ating cost and convenient transportation of charging stations.
By constructing an improved particle swarm optimization

2188