Hybrid PSO6 for hard continuous optimization
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605469075 | ||
| 003 | CHVBK | ||
| 005 | 20210128100320.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150701xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-014-1368-8 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-014-1368-8 | ||
| 245 | 0 | 0 | |a Hybrid PSO6 for hard continuous optimization |h [Elektronische Daten] |c [José García-Nieto, Enrique Alba] |
| 520 | 3 | |a In our previous works, we empirically showed that a number of $$6_{\pm 2}$$ 6 ± 2 informants may endow particle swarm optimization (PSO) with an optimized learning procedure in comparison with other combinations of informants. In this way, the new version PSO6, that evolves new particles from six informants (neighbors), performs more accurately than other existing versions of PSO and is able to generate good particles for a longer time. Despite this advantage, PSO6 may show certain attraction to local basins derived from its moderate performance on non-separable complex problems (typically observed in PSO versions). In this paper, we incorporate a local search procedure to the PSO6 with the aim of correcting this disadvantage. We compare the performance of our proposal (PSO6-Mtsls) on a set of 40 benchmark functions against that of other PSO versions, as well as against the best recent proposals in the current state of the art (with and without local search). The results support our conjecture that the (quasi)-optimally informed PSO, hybridized with local search mechanisms, reaches a high rate of success on a large number of complex (non-separable) continuous optimization functions. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2014 | ||
| 690 | 7 | |a Particle swarm optimization |2 nationallicence | |
| 690 | 7 | |a Fully informed PSO |2 nationallicence | |
| 690 | 7 | |a Multiple trajectory search |2 nationallicence | |
| 690 | 7 | |a Benchmarking functions |2 nationallicence | |
| 700 | 1 | |a García-Nieto |D José |u Department of Lenguajes y Ciencias de la Computación, E.T.S.I. Informática, University of Málaga, Campus de Teatinos, 29071, Malaga, Spain |4 aut | |
| 700 | 1 | |a Alba |D Enrique |u Department of Lenguajes y Ciencias de la Computación, E.T.S.I. Informática, University of Málaga, Campus de Teatinos, 29071, Malaga, Spain |4 aut | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/7(2015-07-01), 1843-1861 |x 1432-7643 |q 19:7<1843 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-014-1368-8 |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-1368-8 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a García-Nieto |D José |u Department of Lenguajes y Ciencias de la Computación, E.T.S.I. Informática, University of Málaga, Campus de Teatinos, 29071, Malaga, Spain |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Alba |D Enrique |u Department of Lenguajes y Ciencias de la Computación, E.T.S.I. Informática, University of Málaga, Campus de Teatinos, 29071, Malaga, Spain |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/7(2015-07-01), 1843-1861 |x 1432-7643 |q 19:7<1843 |1 2015 |2 19 |o 500 | ||