Professional Documents
Culture Documents
Multi Variabel PSO
Multi Variabel PSO
Algorithm
( p1 p2 p3 ) (p1 p2 p3 ) (p1 p2 p3 ) ( p1 p3 p4 )
V. EXPERIMENTAL RESULTS
The c1 is the factor that influences the cognitive behavior, 33 7 Closure is not satisfiable Valid 200
65
i.e., how much the particle will follow its own best solution
and c2 is the factor for social behavior, i.e., how much the 62 74 CNF is satisfiable Valid 120
particle will follow the swarm's best solution. 100 100 CNF is satisfiable Valid 150
2. Calculate the cost for each particle. If the current 83 32 CNF is Satisfiable Valid 236
cost is lower than the best value so far, remember
this position (pBest). 35 59 CNF is Satisfiable Valid 176
3. Choose the particle with the lowest cost of all 43 90 9 Closure is not satisfiable Valid 200
particles. The position of this particle is gBest.
26 79 3 Closure is not satisfiable Valid 200
4. Calculate, for each particle, the new velocity and
position according to the above equations. 88 57 CNF is Satisfiable Valid 109
5. Repeat steps 2-4 until maximum iteration or 91 92 CNF is Satisfiable Valid 167
minimum error criteria is not attained.
98 56 1 Closure is not satisfiable Valid 200
(2
math26.shuffled (2 clauses) (2 clauses) (8 clauses)
clauses)
Also, in order to demonstrate the stability of the results
obtained in the above example, the results obtained by 100% 100%
color-15-4
twenty runs of the algorithm are compared in Figure 9. We 358.43 479.248 (7 clauses) (16 clauses)
can see that all 100 closures are satisfied in all 20 runs. (5
color-22-5 (5 clauses) (41 clauses) (51 clauses)
clauses)
100% 100%
g125.18
281.455 378.660 (2 clauses) (19 clauses)
(57
g250.29 (45 clauses) (34 clauses) (57 clauses)
clauses)
REFERENCES