The Importance of Component-Wise Stochasticity in Particle Swarm Optimization
| Autor: | Andries P. Engelbrecht, Elre T. Oldewage, Christopher Wesley Cleghorn |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
0209 industrial biotechnology
Mathematical optimization Computer science ComputingMethodologies_MISCELLANEOUS Computer Science::Neural and Evolutionary Computation MathematicsofComputing_NUMERICALANALYSIS Scalar (physics) Particle swarm optimization Swarm behaviour 02 engineering and technology Large range ComputingMethodologies_ARTIFICIALINTELLIGENCE Swarm intelligence 020901 industrial engineering & automation 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Scaling Curse of dimensionality |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783030005320 ANTS Conference |
| DOI: | 10.1007/978-3-030-00533-7_21 |
| Popis: | This paper illustrates the importance of independent, component-wise stochastic scaling values, from both a theoretical and empirical perspective. It is shown that a swarm employing scalar stochasticity is unable to express every point in the search space if the problem dimensionality is sufficiently large in comparison to the swarm size. The theoretical result is emphasized by an empirical experiment, comparing the performance of a scalar swarm on benchmarks with reachable and unreachable optima. It is shown that a swarm using scalar stochasticity performs significantly worse when the optimum is not in the span of its initial positions. Lastly, it is demonstrated that a scalar swarm performs significantly worse than a swarm with component-wise stochasticity on a large range of benchmark functions, even when the problem dimensionality allows the scalar swarm to reach the optima. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|