Professional Documents
Culture Documents
Eberhart-Kennedy - A New Optimizer Using PSO PDF
Eberhart-Kennedy - A New Optimizer Using PSO PDF
Russell Eberhart
Purdue School of Engineering and Technology
Indianapolis, IN 46202-5160
eberhart@engr.iupui.edu
James Kennedy
Bureau of Labor Statistics
Washington, DC 20212
kennedyj @pol.ocsp.bls.gov
ABSTRACT
1. INTRODUCTION
0-7803-2676-8/95$4.0001995 IEEE.
39
variables,
3. Compare evaluation with particles previous best value
(PBEST[]): If current value < PBEST[] then PBEST[] =
current value and PBESTx[][d] = current position in Ddimensional hyperspace,
ACC-CONST*rand()*(PBESTx[GBEST]
[d] PresentX[l[d]), and,
40
Table 1 shows results of performance on the XOR neuralnet problem with neighborhood=2. Note that no trials
fixated on local optima- nor have any in hundreds of
unreported tests.
AC C-C ONST
2.0
2.0
38.5
4.0
6.0
28.5
29.5
1.0
0.5
17
33
40.5
37 - 5
53.5
39.5
Iable 2.
CI
4.0
6.0
ACC-CONST
2.0
1.0
0.5
31.5(2)
36(1)
26.5
38.5(1)
27 (1)
25
26
29
41
20
OPTIMIZER
6 CONCLUSIONS
42
ACKNOWLEDGMENT
REFERENCES
[11 T. Baeck, Generalized convergence models for
tournament and (mu,lambda)-selection. Proc. of the
Sixth International Con$ on Genetic Algorithms, pp. 2-7,
Morgan Kaufmann Publishers, San Francisco, CA, 1995.
43