The 7th IEEE International Symposium on Next-Generation Electronics (ISNE 2018)
Solution of the Optimal Reactive Power Dispatch for
Power Systems by Using Novel Charged System
Search Algorithm
Yu-Ming Zhang, Chao-Rong Chen
Electrical Engineering
National Taipei University of Technology
Taipei, Taiwan
saber35118@hotmail.com.tw, crchen@ntut.edu.tw
Abstract—Proper reactive power dispatch can not only reduce
the active power loss, but also can improve the voltage stability,
and make the system operate in the security operation range. In
this paper, we use intelligent control method is used to implement
optimal reactive power dispatch for IEEE30-bus and IEEE57-bus
systems. And we use three types of optimization algorithms to
compare: Charged System Search (CSS), Particle Swarm
Optimization (PSO), and Hybrid Charged System Search and
Particle Swarm Optimization (HCSSPSO). Analysis of reactive
power dispatch benefits. In this paper, the optimal objective
function is to minimize the loss rate in the transmission line, and
satisfies all the constraints of the system, be sure to consider the
optimal objective function range of within a reasonable. From the
simulation results, HCSSPSO can get the global optimal solution
faster than CSS and PSO. Therefore, the times of solve can be
reduced and the global optimal solution can be obtained more
easily. Through the analysis of both the IEEE 30-bus and IEEE
57-bus systems, it is demonstrated that the optimization method
used is feasible for reactive power dispatch, reducing the active
power loss in the transmission line and keeping the load bus
voltage range of within a reasonable. Expect to help dispatchers
make more economical and secure dispatch.
Keywords—Reactive Power dispatch; Voltage Control; Hybrid
Charged System Search and Particle Swarm Optimization.
I. INTRODUCTION
For power systems, it is paramount that the power system be
economical and safe in operation. Therefore, the problem of
reactive power is extremely important to the power system.
Appropriate adjustment can not only reduce the active power
loss, and can improve the voltage stability, making the system
operate in a range of stable operating.
Many studies use intelligent algorithms to solve reactive
power dispatch. In [1-3] proposed various new algorithm to
solve the problem of optimal reactive power dispatch (ORPD),
and in order to avoid falling into the local optimal solution,
proposed various improvements: such as the integration of
algorithms, the modification of strategies and so on, to further
improve the accuracy of the algorithm to solve. Tested on the
standard IEEE system and successfully verified its performance.
The goal of ORPD is to reduce transmission line losses in the
‹,(((
Ching-Yin Lee
Electrical Engineering
Tungnan University
New Taipei (City), Taiwan
cylee@mail.tnu.edu.tw
system and satisfies various constraints of the system, including
power flow equations, generator bus voltage limits, transformer
tap-setting, and reactive power device capacity constraints, to
ensure that the considered optimization objective function range
of within a reasonable.
In terms of charge system search algorithm, Kaveh et al. [4]
proposed an optimization algorithm, which is called Charged
System Search (CSS), and it is based on the related theories of
Coulomb's theorem, Gauss's theorem, Newtonian mechanics
and kinematics. The CSS algorithm treats each variable as a
Charged Particle (CP), which is emulates the charge in space.
Each CP affects other CPs based on their fitness and distance,
and finds the optimal solution by calculating the attractiveness
to update the location and verifies its effectiveness on some test
functions and engineering issues. Chu et al. [5] added the
Particle Moving Evaluation Mechanism to CSS to further
improve the search ability of CSS, and compared with different
algorithms to verify the efficiency is superior to other algorithms.
Kaveh et al. [6] pointed out that in physics, when a charged
particle moves, a magnetic field will be generated. Therefore, in
addition to considering mutual attraction between particles,
magnetic force must also be considered. Therefore, the resultant
force is determined by Lorentz force. This enhances CSS's
global search capability. Proposed in [7-10] is the method of
blending CSS and PSO algorithm, which is based on the method
of PSO algorithm updating speed, taking into account the
advantages of local optimal solution and global optimal solution,
and applying it to the calculation of their resultant force in CSS.
II. PROBLEM FORMULATION
The objective function of the optimal reactive power
dispatch is to minimize the active power loss rate of the
transmission line and load bus voltage and generator reactive
power output within a reasonable range. To achieve these goals,
the system's various constraints must also be satisfies. Including
the power flow equation, the generator bus constraints of
voltage, the tap adjustment range of the transformer limits and
reactive power device capacity constraints, such as Eq. (1)
below.
ಿ ಿ
ಸ ௉ ିσ ವ ௉
‫݂݊݅ܯ‬ሺ‫ݔ‬ሻ ൌ
σೖసభ ಸೖ
ಿ
೗సభ ವ೗
ಸ ௉
ே
൅ ߣଵ σ௟ୀଵ
ವ ୪୧୫୧୲
หܸ݀஽௟
ே
ห ൅ ߣଶ σ௞ୀଵ
ಸ ୪୧୫୧୲
ห݀ܳீ௞ ห (1)
σೖసభ ಸೖ
 The 7th IEEE International Symposium on Next-Generation Electronics (ISNE 2018)

Where ܲீ௞ is active power generation capacity at generator ሺ௩ሻ

ሺೡሻ ሺೡሻ
ቛ‫ ܆‬೔ ି‫ ܆‬ೕ ቛ
bus. ܲ஽௟ is active power demand at load bus. ܰீ is the number ‫ݎ‬௜௝ ൌ ሺೡሻ ሺೡሻ (5)
‫܆‬ శ‫܆‬
೔ ೕ ሺೡሻ
of all generator bus. ܰ஽ is the number of all load bus. ߣଵ ǵߣଶ ቯ
మ
ି‫್ ܆‬೐ೞ೟ ቯାఌ
are the penalty factors for the load bus voltage limit violation
and the generation reactive power limit violation. ܸ݀஽௟ ୪୧୫୧୲
is the In order to make bad CPs can also attractive or repulsive
difference of the voltage limit is violated of the load bus. ݀ܳீ௞୪୧୫୧୲ good CPs, the following methods are used, such as Eq. (6) and
is the difference of reactive power limit is violated of the (7).
generators. ͳǡ ݂݅‫ݐ‬ሺ݅ሻሺ௩ሻ ൏ ݂݅‫ݐ‬ሺ݆ሻሺ௩ሻ
‫ۓ‬ ሺೡሻሺೡሻ
ሺ௩ሻ ௙௜௧ሺ௝ሻ ି௙௜௧್೐ೞ೟
ܲ௜௝ ൌ ܲ௥ሺ௩ሻ ǡ ൐ ‫ݐ݂݅׊݀݊ܽݎ‬ሺ݅ሻሺ௩ሻ ൐ ݂݅‫ݐ‬ሺ݆ሻሺ௩ሻ (6)
III. HYBRID CHARGED SYSTEM SEARCH AND PARTICLE ‫۔‬ ሺೡሻ ሺೡሻ
௙௜௧ሺ௜ሻ ି௙௜௧್೐ೞ೟
SWARM OPTIMIZATION ‫Ͳ ە‬ǡ ݈݁‫݁ݏ‬
In this paper, HCSSPSO algorithm are used. The PSO ሺ௩ሻ ͳǡ ‫ ݀݊ܽݎ‬൏ ͲǤͺ
ܲ௥ ൜ (7)
algorithm is taken into account the advantages of the local െͳǡ ݈݁‫݁ݏ‬
ሺ௩ሻ
optimal solution ‫ –•‡„۾‬௜ and the global optimal solution ሺ௩ሻ
Using Eq. (8) to calculate the force coefficient ݇௜௝ of each
۵„•‡– ሺ௩ሻ , added to the CSS algorithm to calculate the resultant
CPs, using Eq. (9) to determine the magnitude of the force.
force forces. HCSSPSO algorithm required calculation formula
is as follows, the flow chart in Fig. 1. ሺ௩ሻ ‫ݍ‬
ሺ௩ሻ
ሺ௩ሻ ሺ௩ሻ ሺ௩ሻ
݇௜௝ ൌ ቆ ௜ ଷ ‫ݎ‬௜௝ ቇ ܲ௜௝ ǡ ݅ ൌ ͳǡʹǡ ǥ ǡ ݊ ֞ ‫ݎ‬௜௝ ൏ ܽ
Input Eq. (4) calculates CPs ܽ
magnitude of charge
ሺ௩ሻ
(8)
Setting parameters Eq. (5) calculates the ሺ௩ሻ ‫ݍ‬௜ ሺ௩ሻ ሺ௩ሻ
distance between the CPs ݇௜௝ ൌ ቌ ଶ ቍ ܲ௜௝ ǡ ݅ ൌ ͳǡʹǡ ǥ ǡ ݊ ֞ ‫ݎ‬௜௝ ൒ ܽ
ሺ௩ሻ
initialize the CPs with random ቀ‫ݎ‬௜௝ ቁ
positions and their velocities Eq. (6) and (7) determine the probability of
equal to 0 moving and the kind of force vector for each CP ሺ௩ାଵሻ ሺ௩ሻ ሺ௩ሻ ሺ௩ሻ ሺ௩ሻ ሺ௩ሻ
۴௝ ൌ ‫ݍ‬௝ ൫ܿଵ ‫ݎ‬ଵ ൫۱‫ ݐݏܾ݁ۻ‬െ ‫܆‬௝ ൯ ൅ ܿଶ ‫ݎ‬ଶ ൫۱‫ۻ‬௝ െ ‫܆‬௝ ൯
Evaluate the fitness function No
value for each CP Eq. (9) calculates the total resultant force (Fj)
ሺ௩ሻ ሺ௩ሻ ሺ௩ሻ ሺ௩ሻ ሺ௩ሻ ሺ௩ሻ
Eq. (3) updates the CM and
൅ σ௜‫א‬ௌೕభ ݇௜௝ ൫۱‫ۻ‬௜ െ ‫܆‬௝ ൯ ൅ σ௜‫א‬ௌೕమ ݇௜௝ ൫‫ ܆‬௜ െ ‫܆‬௝ ൯ቁ (9)
accesses the fitness function Eq. (13) updates the positions of
value CPs
Where ܿଵ is individual learning factor. ܿଶ is social learning
factor. ‫ݎ‬ଵ ǵ‫ݎ‬ଶ is a random number between 0 and 1.
Is the stop If a CP
Correct its position using
condition
achieved ?
swerves the
side limits
Yes
HS-based algorithm Where ܵ௝ଵ is defined as Eq. (10) and ܵ௝ଶ ൌ ܵ െ ܵ௝ଵ :

Yes
ܵ௝ଵ ൌ ݂݅‫ݐ‬ሺ݆ሻ ൐ ݂݅‫ݐ‬ሺ۱‫ۻ‬௜ ሻ݆ ൌ ͳǡʹǡ ‫ ڮ‬ǡ ݊Ǥ ݆ ് ݅ǡ ݃ (10)
No
Output
Eq. (14) updates the
Inertial weight parameters, defined as Eq. (11) and Eq. (12).
ሺ௩ାଵሻ
velocities of CPs
The new position ‫܆‬௝ of the CPs is calculated by the Eq. (13).
Fig. 1. HCSSPSO algorithm flow chart If a CP swerves the side limits, correct its position using the
harmony search-based handling approach. Eq. (14) to calculate
According to the upper and lower limits ‫ ܆‬௜ǡ௠௔௫ and ‫ ܆‬௜ǡ௠௜௡ ሺ௩ାଵሻ
of the initial solution, the size of the search space of each CP is the new velocity ‫܄‬௝ of CPs.
limited to radius a, the magnitude of a value as shown in Eq. (2). ೡ
݇௩ ሺͳͲିହ ሻೡ೘ೌೣ (11)
ƒ ൌ ͲǤͳ ൈ ƒš൫൛‫ ܆‬୧ǡ୫ୟ୶ െ ‫ ܆‬୧ǡ୫୧୬ ห‹ ൌ ͳǡʹǡ ǥ ǡ ൟ൯ (2) ೡ

According to Eq. (3) rules to establish a charged memory ݇௔ ൌ ሺʹሻ ೡ೘ೌೣ (12)
space. ሺ௩ାଵሻ ۴ೕ
ሺೡሻ
ሺ௩ሻ ሺ௩ሻ
‫܆‬௝ ൌ ߙ૚ ൈ ݇௔ ൈ
௠ೕ
ሺೡሻ ൈ ο‫ ݐ‬ଶ ൅ ߙଶ ൈ ݇௩ ൈ ‫܄‬௝ ൈ ο‫ ݐ‬൅ ‫܆‬௝ (13)
۱‫ۻ‬௜ǡ௢௟ௗ ݂݅‫ݐ‬൫‫ ܆‬௜ǡ௡௘௪ ൯ ൒ ݂݅‫ݐ‬൫۱‫ۻ‬௜ǡ௢௟ௗ ൯
۱‫ۻ‬௜ǡ௡௘௪ ൌቊ (3) ሺೡశభሻ
‫܆‬ೕ
ሺೡሻ
ି‫ ܆‬ೕ
‫ ܆‬௜ǡ௡௘௪ ݂݅‫ݐ‬൫‫ ܆‬௜ǡ௡௘௪ ൯ ൏ ݂݅‫ݐ‬൫۱‫ۻ‬௜ǡ௢௟ௗ ൯ ‫܄‬௝
ሺ௩ାଵሻ
ൌ (14)
ο௧
ሺ௩ሻ
Calculate the magnitude of charge ‫ݍ‬௜ of CP, as shown in ሺ௩ሻ
Eq. (4) Where ݉௝ is the mass of the jth CP which is equal to ‫ݍ‬௝ at the
ሺೡሻ
vth iteration. ο‫ ݐ‬is the time step and is set to unity. ߙଵ ǵߙଶ is a
ሺ௩ሻ ௙௜௧ሺ௜ሻሺೡሻ ି௙௜௧ೢ೚ೝೞ೟
‫ݍ‬௜ ൌ ሺೡሻ ሺೡሻ ǡ ݅ ൌ ͳǡʹǡ ǥ ǡ ݊ (4) random number between 0 and 1.
௙௜௧್೐ೞ೟ ି௙௜௧ೢ೚ೝೞ೟

ሺ௩ሻ IV. OPTIMAL REACTIVE POWER DISPATCH FOR POWER

Where ‫ݍ‬௜ is the magnitude of charge of the ith CPs in vth
ሺ௩ሻ ሺ௩ሻ
iteration. ݂݅‫ݐ‬௕௘௦௧ and ݂݅‫ݐ‬௪௢௥௦௧ are so far the best and the worst SYSTEMS BY USING HCSSPSO ALGORITHM
fitness of all CPs. ݂݅‫ݐ‬ሺ݅ሻሺ௩ሻ is the fitness of ith CPs in vth The test used in this paper the processor is Intel Core i7-3770
iteration. 3.4GHz CPU, 16GB of memory for the desktop computer, the
simulation software used is MATLAB 2015b. In this paper, we
ሺ௩ሻ
Calculate the distance ‫ݎ‬௜௝ between the CPs, as shown in Eq. use CSS algorithm, PSO algorithm and HCSSPSO algorithm to
(5) optimal reactive power in the following two cases respectively:
 The 7th IEEE International Symposium on Next-Generation Electronics (ISNE 2018)

case 1烉 IEEE 30-bus. The initial load of the system is ܲ௅௢௔ௗ ൌ TABLE V. ADJUST THE TRANSFORMER SETTINGS IN CASE 1 (P.U.)
ʹͺ͵ǤͶ and ܳ௅௢௔ௗ ൌ ͳʹ͸Ǥʹ” (the base is OLTC PSO CSS HCSSPSO
100MVA). Assume that the load is changed to ܲ௅௢௔ௗ ൌ T1 1.0250 1.0250 1.0250
ͳͺ͵ǤͶ͵ͺʹ and ܳ௅௢௔ௗ ൌ ͺͷǤ͹ͺ͸ͷ”. T2 0.9500 0.9500 0.9500
T3 0.9750 0.9750 0.9750
case 2烉 IEEE 57-bus. The initial load of the system is ܲ௅௢௔ௗ ൌ T4 0.9750 0.9750 0.9750
ͳʹͷͲǤͺ and ܳ௅௢௔ௗ ൌ ͵͵͸ǤͶ” (the base is
100MVA). Assume the load is changed to ܲ௅௢௔ௗ ൌ TABLE VI. REACTIVE POWER UNIT CAPACITY IN CASE 1 (P.U.)
ͻͻ͵ǤͶͶ͸ͻ, ܳ௅௢௔ௗ ൌ ʹ͹ͲǤͻ͵ͺͺ”. Bus No. PSO CSS HCSSPSO
Consider the goal of minimize transmission line loss rates 10 0.1600 0.1600 0.1600
24 0.0800 0.0800 0.0800
and satisfies all the constraints of the system. Comparing the
three algorithms, it is proved that the HCSSPSO algorithm can
be more effectively applied to the problem of reactive power
dispatch. Under the same objective function and constraint
conditions, the convergence condition is that the convergence
error less than 0.000001 for 400 iterations. Parameter settings as
shown in Table 1.

TABLE I. THREE TYPES OF ALGORITHMS PARAMETERS SETTINGS

Case 1 Case 2 algorithms
iterations 1000 2000 all
Number of particles 40 50
c1, c2 2ǵ2 2ǵ2 Fig. 2. Convergence diagram of reactive power dispatch for case 1
PSO
Inertial weight parameters 0.9ʈ0.4 0.9ʈ0.4
The number of CPs 40 50
CSSǵ
CMCR 0.95 0.95
HCSSPSO
PAR 0.1 0.1
Considering the same load, we use Eq. (1) as the fitness
function of reactive power dispatch. Table 2 shows the results of
50 times of the three algorithms performed in case 1, Table 3
shows the transmission line losses of case 1 using PSO, CSS and
HCSSPSO after reactive power dispatch. Table 4 to Table 6 is
the system control variables set results of case 1. Figure 2 is the
convergence of the optimal solution for the three algorithms in
case 1. Figure 3 shows the voltage distribution of the bus in case Fig. 3. Voltage distribution diagram of bus after system reactive power dispatch
1 after dispatch. in case 1

Table 7 shows the results of 50 times of the three algorithms

TABLE II. THE RESULTS OF 50 TIMES OF THE THREE ALGORITHMS performed in case 2; Table 8 shows the transmission line losses
PERFORMED IN CASE 1
in case 2 using PSO, CSS and HCSSPSO after reactive power
Fitness function value dispatch. Table 9 to Table 11 is the system control variables set
algorithm
best mean Worst results of case 2. Figure 4 is the convergence of the optimal
PSO 0.01429 0.01474 0.01539 solution for the three algorithms in case 2. Figure 5 shows the
CSS 0.01429 0.01433 0.01466 voltage distribution of the bus in case 2 after dispatch.
HCSSPSO 0.01429 0.01430 0.01432

TABLE III. THE RESULT OF REACTIVE POWER DISPATCH IN CASE 1 TABLE VII. THE RESULTS OF 50 TIMES OF THE THREE ALGORITHMS
PERFORMED IN CASE 2
algorithm transmission line lossesሺࡼ࢒࢕࢙࢙ሻ(MW) Fitness function value
PSO 2.7020 algorithm
Minimum mean Worst
CSS 2.7020 PSO 0.02307 7064.74225 117082.38342
HCSSPSO 2.7019 CSS 0.02268 0.02380 0.02641
HCSSPSO 0.02259 0.02272 0.02289
TABLE IV. GENERATOR BUS VOLTAGE SETTING IN CASE 1 (P.U.)
TABLE VIII. THE RESULT OF REACTIVE POWER DISPATCH IN CASE 2
Bus No. PSO CSS HCSSPSO
1 1.0500 1.0500 1.0500 algorithm transmission line lossesሺࡼ࢒࢕࢙࢙ሻ(MW)
2 1.0423 1.0424 1.0422
5 1.0262 1.0266 1.0262 PSO 23.4601
8 1.0324 1.0326 1.0324 CSS 23.0594
11 1.0500 1.0488 1.0488 HCSSPSO 22.9593
13 1.0500 1.0500 1.0500
 The 7th IEEE International Symposium on Next-Generation Electronics (ISNE 2018)

TABLE IX. GENERATOR BUS VOLTAGE SETTING IN CASE 2 (P.U.) V. CONCLUSION

Bus No. PSO CSS HCSSPSO In this paper, PSO, CSS and HCSSPSO algorithm are used
1 1.0600 1.0596 1.0600 to solve the optimal reactive power dispatch problem. The
2 1.0513 1.0531 1.0576
simulation system uses IEEE 30-bus and IEEE 57-bus. The
3 1.0254 1.0374 1.0506
6 1.0114 1.0215 1.0365 objective function of reactive power dispatch considered that is
8 1.0135 1.0265 1.0407 to minimize the active power loss rate of transmission line, the
9 0.9997 1.0108 1.0246 load bus voltage and generator reactive power output within a
12 1.0081 1.0172 1.0311 reasonable range. From the simulation results, we know that all
three algorithms can make the voltage distribution of bus within
TABLE X. ADJUST THE TRANSFORMER SETTINGS IN CASE 2 (P.U.) the limited operating range.
OLTC PSO CSS HCSSPSO When applying the HCSSPSO algorithm to solve the optimal
T1 0.9500 0.9625 1.0125 reactive power dispatch problem, the active power loss of the
T2 1.0500 1.0250 0.9875
transmission line is smaller than that of the PSO or CSS
T3 1.0500 1.0250 1.0000
T4 0.9500 0.9625 0.9875 algorithm and the convergence speed is faster. It shows that this
T5 1.0000 0.9625 1.0125 algorithm can efficiently search the global optimal solution in
T6 1.0500 0.9875 0.9875 the process of solving. It proves that the HCSSPSO algorithm
T7 1.0125 0.9625 0.9750 can make the voltage distribute of bus in system within a
T8 0.9500 0.9500 0.9750 reasonable range, reduce the active power loss of the
T9 0.9500 0.9500 0.9625 transmission line, to achieve safety considerations, looking
T10 0.9500 0.9625 0.9750 forward to be able to help dispatchers make more accurate,
T11 0.9625 0.9500 0.9750
economical and safe dispatch.
T12 0.9750 0.9625 0.9750
T13 0.9500 0.9500 0.9500
T14 0.9500 0.9625 0.9625 REFERENCES
T15 1.0500 1.0125 1.0125
[1] M. Ghasemi, S. Ghavidel, M. M. Ghanbarian, A. Habibi, “A new hybrid
T16 0.9625 0.9875 0.9875
algorithm for optimal reactive power dispatch problem with discrete and
T17 1.0000 0.9500 0.9625 continuous control variables,” Applied Soft Computing, vol. 22, 2014, pp.
126-140.
TABLE XI. REACTIVE POWER UNIT CAPACITY IN CASE 2 (P.U.) [2] M. Ghasemi, M. M. Ghanbarian, S. Ghavidel, S. Rahmani, E. Mahboubi
Bus No. PSO CSS HCSSPSO Moghaddam, “Modified teaching learning algorithm and double
differential evolution algorithm for optimal reactive power dispatch
18 0.0900 0.1300 0.1400
problem: A comparative study,” Information Sciences, vol. 278, 2014, pp.
25 0.0900 0.0800 0.0900 231-249.
53 0.1100 0.1100 0.1100
[3] T. Niknam, M. R. Narimani, R. Azizipanah-Abarghooee, B. Bahmani-
Firouzi, “Multi objective Optimal Reactive Power Dispatch and Voltage
Control: A New Opposition-Based Self-Adaptive Modified Gravitational
Search Algorithm,” IEEE Systems Journal, vol. 7, Issue 4, 2013, pp. 742-
753.
[4] A. Kaveh and S. Talatahari, “A novel heuristic optimization method:
charged system search,” Acta Mechanica, vol. 213, Issue 3-4, 2010, pp.
267-289.
[5] C. C. Chu and M. S. Tsai, “Application of Novel Charged System Search
With Real Number String for Distribution System Loss Minimization,”
IEEE Transactions on Power Systems, vol. 28, Issue 4, 2013, pp. 3600-
3609.
[6] A. Kaveh, B. Mirzaei, A. Jafarvand, “An improved magnetic charged
system search for optimization of truss structures with continuous and
discrete variables,” Applied Soft Computing, vol. 28, pp. 400í410, Dec.
Fig. 4. Convergence diagram of reactive power dispatch for case 2 2014.
[7] A. Kaveh and A. Nasrollahi, “Charged system search and particle swarm
optimization hybridized for optimal design of engineering structures,”
Scientia Iranica, pp. 295-305, Sep. 2013.
[8] Y. Kumar, G. Sahoo, “Hybridization of magnetic charge system search
and particle swarm optimization for efficient data clustering using
neighborhood search strategy,” Soft Computing, vol. 19, pp. 3621í3645,
Jun. 2015.
[9] S. Talatahari, Y. Jahani, “hybrid charged system search-particle swarm
optimization for design of single-layer barrel vault structures,” Asian
journal of civil engineering, vol. 16, pp. 515í533, Feb. 2015.
[10] A. Kaveh, B. Hashemi Soudmand, R. Sheikholeslami, “optimal design of
laminated composite structures via hybrid charged system search and
particle swarm optimization,” Asian journal of civil engineering, vol. 14,
Fig. 5. Voltage distribution diagram of bus after system reactive power dispatch
pp. 587í604, Feb. 2013.
in case 2