Modified simulated annealing and particle swarm optimization algorithm
A technology of particle swarm optimization and simulated annealing, which is applied to AC networks to reduce harmonics/ripples, reactive power compensation, harmonic reduction devices, etc., to achieve optimistic economic benefits, reduced capacity, and high convergence speed
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0018] As shown in Figure 1, in the particle swarm optimization algorithm, the total number of particles in the particle swarm is N, and each particle has a position x in space i , the particle starts from x i at speed v i Flying forward, the optimal position searched by each particle in the space is p i , the optimal position searched by the entire particle swarm in the space is p g , x i The correction amount of the k-th iteration is v k i =[v k i1 , v k i2 ,...,v k in ], and its calculation formula is as follows:
[0019] v k i =wv k-1 i +c 1 rand 1 (p i -x k-1 i )+c 2 rand 2 (p g -x k-1 i )x k i =x k-1 i +v k-1 i i=, 2, ..., N (1)
[0020] In formula (1), k is the number of iterations; c 1 and c 2 is the acceleration factor, rand 1 and rand 2 are two independent random numbers between [0, 1]; w is the inertia coefficient, adjusting its size can change the search ability. The iteration termination condition of the algorithm is select...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 



