Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Runtime Analysis of Binary PSO
نویسندگان
چکیده
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and a swarm of particles. Each particle consists of a current position, an own best position and a velocity vector used in a probabilistic process to update the particle’s position. We present lower bounds for a broad class of implementations with swarms of polynomial size. To prove upper bounds, we transfer a fitness-level argument well-established for evolutionary algorithms (EAs) to PSO. This method is then applied to estimate the expected runtime on the class of unimodal functions. A simple variant of the Binary PSO is considered in more detail. The 1-PSO only maintains one particle, hence own best and global best solutions coincide. Despite its simplicity, the 1-PSO is surprisingly efficient. A detailed analysis for the function OneMax shows that the 1-PSO is competitive to EAs.
منابع مشابه
Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods
Occasionally there have been long debates on whether to use elitist selection or not. In the present paper the simple (1,λ) EA and (1+λ) EA operating on {0, 1}n are compared by means of a rigorous runtime analysis. It turns out that only values for λ that are logarithmic in n are interesting. An illustrative function is presented for which newly developed proof methods show that the (1,λ) EA—wh...
متن کاملDesign and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Analysis of a Simple Evolutionary Algorithm for the Minimization in Euclidian Spaces
and was printed with financial support of the Deutsche Forschungsgemeinschaft.
متن کاملDesign and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Coevolution for Classification
متن کامل
TECHNISCHE UNIVERSITÄT DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Theoretical Analysis of Diversity Mechanisms for Global Exploration
Maintaining diversity is important for the performance of evolutionary algorithms. Diversity mechanisms can enhance global exploration of the search space and enable crossover to find dissimilar individuals for recombination. We focus on the global exploration capabilities of mutation-based algorithms. Using a simple bimodal test function and rigorous runtime analyses, we compare well-known div...
متن کاملDesign and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods On the Size of Weights in Randomized Search Heuristics
Runtime analyses of randomized search heuristics for combinatorial optimization problems often depend on the size of the largest weight. We consider replacing the given set of weights with smaller weights such that the behavior of the randomized search heuristic does not change. Upper bounds on the size of the new, equivalent weights allow us to obtain upper bounds on the expected runtime of su...
متن کامل