Runtime analysis of a binary particle swarm optimizer

Theoretical Computer Science

Volumn 411, Issue 21, 2010, Pages 2084-2100

  Sudholt, Dirk ^a   Witt, Carsten ^b  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Particle swarm optimization; Runtime analysis

Indexed keywords

BEST POSITION; BINARY PARTICLE SWARM; BINARY PSO; EXPERIMENTAL COMPARISON; LOWER BOUNDS; PROBABILISTIC PROCESS; PSEUDO-BOOLEAN FUNCTION; RUN-TIME ANALYSIS; RUNTIMES; TEST FUNCTIONS; UNIMODAL FUNCTIONS; UPPER BOUND; VELOCITY VECTORS;

GATES (TRANSISTOR); PARTICLE SWARM OPTIMIZATION (PSO);

BOOLEAN FUNCTIONS;

EID: 77950595650     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.03.002     Document Type: Article

References (29)

1. Attiratanasunthron N., and Fakcharoenphol J. A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs. Information Processing Letters 105 3 (2008) 88-92
2. Bratton D., and Kennedy J. Defining a standard for particle swarm optimization. Proc. of Swarm Intelligence Symposium, SIS 2007 (2007), IEEE Press 120-127
3. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. 2nd edition (2001), The MIT Press
4. Doerr B., Neumann F., Sudholt D., and Witt C. On the runtime analysis of the 1-ANT ACO algorithm. Proc. of GECCO'07 (2007), ACM Press 33-40
5. Droste S. A rigorous analysis of the compact genetic algorithm for linear functions. Natural Computing 5 3 (2006) 257-283
6. Droste S., Jansen T., and Wegener I. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276 (2002) 51-81
7. Giel O., and Wegener I. Evolutionary algorithms and the maximum matching problem. Proc. of STACS'03. LNCS vol. 2607 (2003) 415-426
8. Gutjahr W.J. First steps to the runtime complexity analysis of ant colony optimization. Computers and Operations Research 35 9 (2008) 2711-2727
9. Gutjahr W.J., and Sebastiani G. Runtime analysis of ant colony optimization with best-so-far reinforcement. Methodology and Computing in Applied Probability 10 (2008) 409-433
10. Hoeffding W. Probability inequalities for sums of bounded random variables. American Statistical Association Journal 58 301 (1963) 13-30
11. Horoba C., and Sudholt D. Running time analysis of ACO systems for shortest path problems. Proc. of SLS 2009. LNCS vol. 5752 (2009) 76-91
12. Kennedy J., and Eberhart R.C. Particle swarm optimization. Proc. of the IEEE International Conference on Neural Networks (1995), IEEE Press 1942-1948
13. J. Kennedy, R.C. Eberhart, A discrete binary version of the particle swarm algorithm, in: Proc. of the World Multiconference on Systemics, Cybernetics and Informatics, WMSCI, 1997, pp. 4104-4109.
14. Kennedy J., Eberhart R.C., and Shi Y. Swarm Intelligence (2001), Morgan Kaufmann
15. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge University Press
16. H. Mühlenbein, How genetic algorithms really work: Mutation and hillclimbing, in: Parallel Problem Solving from Nature, PPSN II, 1992, pp. 15-26.
17. Neumann F., Sudholt D., and Witt C. Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intelligence 3 1 (2009) 35-68
18. Neumann F., and Wegener I. Minimum spanning trees made easier via multi-objective optimization. Natural Computing 5 3 (2006) 305-319
19. Neumann F., and Wegener I. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science 378 1 (2007) 32-40
20. Neumann F., and Witt C. Ant Colony Optimization and the minimum spanning tree problem. Proceedings of Learning and Intelligent Optimization, LION'07. LNCS vol. 5313 (2008), Springer 153-166
21. Neumann F., and Witt C. Runtime analysis of a simple Ant Colony Optimization algorithm. Algorithmica 54 2 (2009) 243-255
22. Oliveto P.S., He J., and Yao X. Time complexity of evolutionary algorithms for combinatorial optimization: a decade of results. International Journal of Automation and Computing 4 3 (2007) 281-293
23. Reichel J., and Skutella M. Evolutionary algorithms and matroid optimization problems. Proc. of GECCO'07 (2007), ACM Press 947-954
24. Scharnow J., Tinnefeld K., and Wegener I. The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms (2004) 349-366
25. Y. Shi, R.C. Eberhart, Parameter selection in particle swarm optimization, in: Proc. of the Seventh Annual Conference on Evolutionary Programming, 1998, pp. 591-600.
26. Wegener I. Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In: Sarker R., Yao X., and Mohammadian M. (Eds). Evolutionary Optimization (2002), Kluwer 349-369
27. Witt C. Worst-case and average-case approximations by simple randomized search heuristics. Proc. of STACS~'05. LNCS vol. 3404 (2005) 44-56
28. Witt C. Why standard particle swarm optimisers elude a theoretical runtime analysis. Foundations of Genetic Algorithms 10, FOGA'09 (2009), ACM Press 13-20
29. Christian Horoba, Dirk Sudholt, Ant colony optimization for stochastic shortest path problems, in: Proc. of GECCO'10, 2010 (in press).