Population statistics for particle swarm optimization: Single-evaluation methods in noisy optimization problems
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605468818 | ||
| 003 | CHVBK | ||
| 005 | 20210128100318.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150901xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-014-1438-y |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-014-1438-y | ||
| 245 | 0 | 0 | |a Population statistics for particle swarm optimization: Single-evaluation methods in noisy optimization problems |h [Elektronische Daten] |c [Juan Rada-Vilela, Mark Johnston, Mengjie Zhang] |
| 520 | 3 | |a Particle swarm optimization (PSO) is a metaheuristic whose quality of results deteriorates significantly in optimization problems subject to noise. The underlying reason to such a deterioration is that the effect of noise hinders the ability of particles to distinguish good from bad solutions, leading them to suffer from deception, blindness and disorientation. A deceived particle is not partially attracted to the true best solution in its neighborhood, a blinded particle misses an opportunity to improve upon its personal best solution, and a disoriented particle mistakenly prefers a worse solution. These conditions need to be addressed via noise mitigation mechanisms to prevent (or at least reduce) such a deterioration. Single-evaluation methods are the name by which we refer to PSO algorithms that address the effect of noise without performing additional function evaluations. The first of these algorithms was PSO with evaporation (PSO-E), which was proposed to reduce blindness in the swarms, and reports have suggested that it succeeds at finding better solutions than the regular PSO in different stochastic and dynamic optimization problems. However, PSO-E depends on an evaporation factor whose value is determined empirically, and the swarm is always at risk of exhibiting divergent behaviour. In this article, we propose a method to determine a priori the evaporation factor for PSO-E, and we also propose a new PSO with probabilistic updates (PSO-PU) to prevent the risk of divergence. Additionally, we take a different approach and develop a new PSO with average neighborhoods (PSO-AN) to blur the effect of noise and thereby reduce deception. Experiments on 20 large-scale benchmark functions subject to different levels of noise show that the regular PSO (lacking a noise mitigation mechanism) generally finds better solutions than PSO-E and PSO-PU because their approaches cause too much disorientation. However, PSO-AN finds better solutions than the regular PSO thanks to the improved quality of its neighborhood best solutions that partially attract the swarm towards better regions of the search space. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2014 | ||
| 690 | 7 | |a Particle swarm optimization |2 nationallicence | |
| 690 | 7 | |a Population statistics |2 nationallicence | |
| 690 | 7 | |a Noisy optimization problems |2 nationallicence | |
| 690 | 7 | |a Single-evaluation methods |2 nationallicence | |
| 690 | 7 | |a Evaporation mechanism |2 nationallicence | |
| 700 | 1 | |a Rada-Vilela |D Juan |u Evolutionary Computation Research Group, Victoria University of Wellington, Wellington, New Zealand |4 aut | |
| 700 | 1 | |a Johnston |D Mark |u Evolutionary Computation Research Group, Victoria University of Wellington, Wellington, New Zealand |4 aut | |
| 700 | 1 | |a Zhang |D Mengjie |u Evolutionary Computation Research Group, Victoria University of Wellington, Wellington, New Zealand |4 aut | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/9(2015-09-01), 2691-2716 |x 1432-7643 |q 19:9<2691 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-014-1438-y |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s00500-014-1438-y |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Rada-Vilela |D Juan |u Evolutionary Computation Research Group, Victoria University of Wellington, Wellington, New Zealand |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Johnston |D Mark |u Evolutionary Computation Research Group, Victoria University of Wellington, Wellington, New Zealand |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Zhang |D Mengjie |u Evolutionary Computation Research Group, Victoria University of Wellington, Wellington, New Zealand |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/9(2015-09-01), 2691-2716 |x 1432-7643 |q 19:9<2691 |1 2015 |2 19 |o 500 | ||