Why Standard Particle Swarm Optimizers elude a theoretical runtime analysis

Proceedings of the 10th ACM SIGEVO Workshop on Foundations of Genetic Algorithms, FOGA'09

Volumn , Issue , 2009, Pages 13-19

  Witt, Carsten ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Particle swarm optimisation; Runtime analysis

Indexed keywords

ANT COLONY OPTIMISATION; BIO-INSPIRED; CONVERGENCE ANALYSIS; GUARANTEED CONVERGENCE; OPTIMAL CONVERGENCE; OPTIMISATIONS; PARTICLE SWARM; PARTICLE SWARM OPTIMISATION; RECENT TRENDS; RUNTIME ANALYSIS; RUNTIMES; SEARCH HEURISTICS; SINGLE PARTICLE; STANDARD PARTICLE SWARM OPTIMIZERS; STANDARD PSO; TEST FUNCTIONS;

EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; STANDARDS;

CONVERGENCE OF NUMERICAL METHODS;

EID: 70349139937     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1527125.1527128     Document Type: Conference Paper

References (27)

1. P. J. Angeline. Evolutionary optimization versus particle swarm optimization: Philosophy and performance differences. In Proc. of Evolutionary Programming VII, volume 1447 of LNCS, pages 601-610. Springer, 1998.
2. D. M. Bradley and R. C. Gupta. On the distribution of the sum of n non-identically distributed uniform random variables. Annals of the Institute of Statistical Mathematics, 54(3):689-700, 2002.
3. E. Campana, G. Fasano, D. Peri, and A. Pinto. Particle swarm optimization: efficient globally convergent modifications. In Proc. of the 3rd European Conference on Computational Mechanics, Solids, Structures and Coupled Systems in Engineering, 2006.
4. M. Clerc. Particle Swarm Optimization. ISTE, 2006.
5. M. Clerc and J. Kennedy. The particle swarm -explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation, 6(1):58-73, 2002.
6. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51-81, 2002.
7. W. Feller. An Introduction to Probability Theory and Its Applications, volume 2. Wiley, 2nd edition, 1971.
8. W. J. Gutjahr. Mathematical runtime analysis of ACO algorithms: Survey on an emerging issue. Swarm Intelligence, 1:59-79, 2007.
9. N. Hansen, R. Ros, N. Mauny, M. Schoenauer, and A. Auger. PSO facing non-separable and ill-conditioned problems. Research Report 6447, INRIA, France, Feb. 2008.
10. W. Hoeffding. Probability inequalities for sums of bounded random variables. American Statistical Association Journal, 58(301): 13-30, 1963.
11. J. Jägersküpper. How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms. Theoretical Computer Science, 361(1):38-56, 2006.
12. J. Jägersküpper. Analysis of a simple evolutionary algorithm for minimization in Euclidean spaces. Theoretical Computer Science, 379(3):329-347, 2007.
13. J. Jägersküpper. Lower bounds for randomized direct search with isotropic sampling. Operations Research Letters, 36:327-332, 2007.
14. J. Jägersküpper and C. Witt. Rigorous runtime analysis of a (μ+1) ES for the sphere function. In Proc. of GECCO '05, pages 849-856. ACM Press, 2005.
15. M. Jiang, Y. P. Luo, and S. Y. Yang. Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm. Information Processing Letters, 102(1):8-16, 2007.
16. J. Kennedy. Bare bones particle swarms. In Proc. of the IEEE Swarm Intelligence Symposium, pages 80-87, 2003.
17. J. Kennedy and R. C. Eberhart. Particle swarm optimization. In Proc. of the IEEE International Conference on Neural Networks, pages 1942-1948. IEEE Press, 1995.
18. J. Kennedy, R. C. Eberhart, and Y. Shi. Swarm Intelligence. Morgan Kaufmann, 2001.
19. C. Li, Y. Liu, A. Zhou, L. Kang, and H. Wang. A fast particle swarm optimization algorithm with Cauchy mutation and natural selection strategy. In Proc. of ISICA '07, volume 4683 of Notes in Computer Science, pages 334-343. Springer, 2007.
20. P. S. Oliveto, J. He, and X. Yao. Computational complexity analysis of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing, 4(3):281-293, 2007.
21. A. Ratnaweera, S. Halgamuge, and H. C. Watson. Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Transactions on Evolutionary Computation, 8(3):240-255, 2004.
22. S. A. Roach. The frequency distribution of the sample mean where each member of the sample is drawn from a different rectangular distribution. Biometrika, 50:508-513, 1963.
23. D. Sudholt and C. Witt. Runtime analysis of binary PSO. In Proc. of GECCO '08, pages 135-142. ACM Press, 2008.
24. I. C. Trelea. The particle swarm optimization algorithm: convergence analysis and parameter selection. Information Processing Letters, 85(6):317-325, 2003.
25. F. van den Bergh. An Analysis of Particle Swarm, Optimizers. PhD thesis, Department of Computer Science, University of Pretoria, South Africa, 2002.
26. F. van den Bergh and A. P. Engelbrecht. A new locally convergent particle swarm optimiser. In Proc. of the IEEE International Conference on Systems, Man and Cybernetics, 2002.
27. I. Wegener. Simulated annealing beats Metropolis in combinatorial optimization. In Proc. of ICALP '05, volume 3580 of LNCS, pages 589-601. Springer, 2005.