Moritz Mühlenthaler
Rolf Wanka
ABSTRACT
We present the analysis of a discrete particle swarm optimization (PSO) algorithm that works on a significantly large class of discrete optimization problems. Assuming a black-box setting, we prove upper and lower bounds on the expected number of function evaluations required by the proposed algorithm to solve the sorting problem and the problem of maximizing the number of ones in a bitstring, i.e., the function OneMax. We show that depending on the probability of moving towards the attractor, the expected optimization time may be polynomial or exponential. The cornerstone of our analysis are Theta-bounds on the expected time it takes until the PSO returns to the attractor. We obtain these bounds by solving linear recurrence equations with constant and non-constant coefficients. We also introduce a useful indistinguishability property of states of a Markov chain in order to obtain lower bounds on the expected optimization time of our proposed PSO algorithm.
- M. Clerc. Discrete particle swarm optimization, illustrated by the Traveling Salesman Problem. In New Optimization Techniques in Engineering, chapter 8, pages 219--239. 2004. Google Scholar
Cross Ref
- B. Doerr, F. Neumann, D. Sudholt, and C. Witt. On the runtime analysis of the 1-ANT ACO algorithm. In Proc. 9th ACM Genetic and Evolutionary Computation Conference (GECCO), pages 33--40, 2007. Google ScholarDigital Library
- S. Droste, T. Jansen, and I. Wegener. Dynamic parameter control in simple evolutionary algorithms. In Proc. 6th Workshop on Foundations of Genetic Algorithms (FOGA), pages 275--294, 2001. Google ScholarCross Ref
- S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1Google Scholar
- 1) evolutionary algorithm. Theoretical Computer Science, 276(1):51--81, 2002.Google Scholar
- R. C. Eberhart and J. Kennedy. A new optimizer using particle swarm theory. In Proc. 6th International Symposium on Micro Machine and Human Science, pages 39--43, 1995. Google ScholarCross Ref
- O. Giel and I. Wegener. Evolutionary algorithms and the maximum matching problem. In Proc. 20th Symp. on Theoretical Aspects of Computer Science (STACS), pages 415--426, 2003. Google ScholarCross Ref
- R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley Longman, 2nd edition, 1994.Google Scholar
- M. Hoffmann, M. Mühlenthaler, S. Helwig, and R. Wanka. Discrete particle swarm optimization for TSP: Theoretical results and experimental evaluations. In Proc. 2nd Int. Conf. on Adaptive and Intelligent Systems (ICAIS), pages 416--427, 2011. Google ScholarCross Ref
- J. Kennedy and R. C. Eberhart. Particle swarm optimization. In Proc. IEEE International Conference on Neural Networks, volume 4, pages 1942--1948, 1995. Google ScholarCross Ref
- J. Kennedy and R. C. Eberhart. A discrete binary version of the particle swarm algorithm. In Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics, volume 5, pages 4104--4108, 1997. Google ScholarCross Ref
- M. Mitzenmacher and E. Upfal. Probability and Computing. Cambridge University Press, 2005. Google ScholarCross Ref
- F. Neumann and C. Witt. Runtime analysis of a simple ant colony optimization algorithm. Algorithmica, 54(2):243--255, 2007. Google ScholarDigital Library
- J. E. Onwunalu and L. J. Durlofsky. Application of a particle swarm optimization algorithm for determining optimum well location and type. Computational Geosciences, 14:183--198, 2010. Google ScholarCross Ref
- C. H. Papadimitriou. On selecting a satisfying truth assignment. In Proc. 32nd IEEE Symp. on Foundations of Computer Science (FOCS), pages 163--169, 1991. Google ScholarDigital Library
- M. Petkov\v sek. Hypergeometric solutions of linear recurrences with polynomial coefficients. Journal of Symbolic Computation, 14(2):243--264, 1992.Google Scholar
- K. Ramanathan, V. M. Periasamy, M. Pushpavanam, and U. Natarajan. Particle swarm optimisation of hardness in nickel diamond electro composites. Archives of Computational Materials Science and Surface Engineering, 1:232--236, 2009.Google Scholar
- J. Scharnow, K. Tinnefeld, and I. Wegener. The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms, 3(4):349--366, 2004. Google ScholarCross Ref
- B. I. Schmitt. Convergence analysis for particle swarm optimization. Doctoral thesis, University of Erlangen-Nuremberg, Germany, 2015.Google Scholar
- U. Schöning. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In Proc. 40th IEEE Symp. on Foundations of Computer Science (FOCS), pages 410--414, 1999. Google ScholarCross Ref
- L. Schwab, M. Schmitt, and R. Wanka. Multimodal medical image registration using particle swarm optimization with influence of the data's initial orientation. In Proc. 12th IEEE Conf. on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB), pages 403--410, 2015. Google ScholarCross Ref
- D. Sudholt and C. Witt. Runtime analysis of binary PSO. In Proc. 10th ACM Genetic and Evolutionary Computation Conf. (GECCO), pages 135--142, 2008. Google ScholarDigital Library
- D. Sudholt and C. Witt. Runtime analysis of a binary particle swarm optimizer. Theoretical Computer Science, 411(21):2084--2100, 2010. Google ScholarDigital Library
- K. Veeramachaneni, L. Osadciw, and G. Kamath. Probabilistically driven particle swarms for optimization of multi valued discrete problems: Design and analysis. In Proc. IEEE Swarm Intelligence Symposium (SIS), pages 141--149, 2007. Google ScholarDigital Library
- M. P. Wachowiak, R. Smolíková, Y. Zheng, J. M. Zurada, and A. S. Elmaghraby. An approach to multimodal biomedical image registration utilizing particle swarm optimization. IEEE Transactions on Evolutionary Computation, 8:289--301, 2004. Google ScholarDigital Library
- I. Wegener. Evolutionary Optimization, chapter Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions, pages 349--369. Springer US, Boston, MA, 2002.Google Scholar
- Q. Yang, J. Wu, Y. Li, W. Li, L. Wang, and Y. Yang. Using the particle swarm optimization algorithm to calibrate the parameters relating to the turbulent flux in the surface layer in the source region of the Yellow River. Agricultural and Forest Meteorology, 232:606--622, 2017. Google ScholarCross Ref
Index Terms
- Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax
Recommendations
Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax
AbstractMeta-heuristics are powerful tools for solving optimization problems whose structural properties are unknown or cannot be exploited algorithmically. We propose such a meta-heuristic for a large class of optimization problems over discrete domains ...
Set-based discrete particle swarm optimization and its applications: a survey
Particle swarm optimization (PSO) is one of the most popular population-based stochastic algorithms for solving complex optimization problems. While PSO is simple and effective, it is originally defined in continuous space. In order to take advantage of ...
Fitness proportionate selection based binary particle swarm optimization
GECCO Comp '14: Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary ComputationParticle Swarm Optimization(PSO) has shown its advantages not only in dealing with continous optimization problems, but also in dealing with discrete optimization problems. Binary Particle Swarm Optimization(BPSO), the discrete version of PSO, has been ...
Comments