A two-layer surrogate-assisted particle swarm optimization algorithm
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605468672 | ||
| 003 | CHVBK | ||
| 005 | 20210128100318.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150601xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-014-1283-z |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-014-1283-z | ||
| 245 | 0 | 2 | |a A two-layer surrogate-assisted particle swarm optimization algorithm |h [Elektronische Daten] |c [Chaoli Sun, Yaochu Jin, Jianchao Zeng, Yang Yu] |
| 520 | 3 | |a Like most evolutionary algorithms, particle swarm optimization (PSO) usually requires a large number of fitness evaluations to obtain a sufficiently good solution. This poses an obstacle for applying PSO to computationally expensive problems. This paper proposes a two-layer surrogate-assisted PSO (TLSAPSO) algorithm, in which a global and a number of local surrogate models are employed for fitness approximation. The global surrogate model aims to smooth out the local optima of the original multimodal fitness function and guide the swarm to fly quickly to an optimum or the global optimum. In the meantime, a local surrogate model constructed using the data samples near each particle is built to achieve a fitness estimation as accurate as possible. The contribution of each surrogate in the search is empirically verified by experiments on uni- and multi-modal problems. The performance of the proposed TLSAPSO algorithm is examined on ten widely used benchmark problems, and the experimental results show that the proposed algorithm is effective and highly competitive with the state-of-the-art, especially for multimodal optimization problems. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2014 | ||
| 690 | 7 | |a Particle swarm optimization |2 nationallicence | |
| 690 | 7 | |a Surrogate-assisted optimization |2 nationallicence | |
| 690 | 7 | |a Computationally expensive optimization problems |2 nationallicence | |
| 700 | 1 | |a Sun |D Chaoli |u Complex System and Computational Intelligence Laboratory, Taiyuan University of Science and Technology, 030024, Taiyuan, Shanxi, China |4 aut | |
| 700 | 1 | |a Jin |D Yaochu |u Department of Computing, University of Surrey, GU2 7XH, Guildford, UK |4 aut | |
| 700 | 1 | |a Zeng |D Jianchao |u Complex System and Computational Intelligence Laboratory, Taiyuan University of Science and Technology, 030024, Taiyuan, Shanxi, China |4 aut | |
| 700 | 1 | |a Yu |D Yang |u National Key Laboratory for Novel Software Technology, Nanjing University, 200093, Nanjing, China |4 aut | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/6(2015-06-01), 1461-1475 |x 1432-7643 |q 19:6<1461 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-014-1283-z |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-1283-z |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Sun |D Chaoli |u Complex System and Computational Intelligence Laboratory, Taiyuan University of Science and Technology, 030024, Taiyuan, Shanxi, China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Jin |D Yaochu |u Department of Computing, University of Surrey, GU2 7XH, Guildford, UK |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Zeng |D Jianchao |u Complex System and Computational Intelligence Laboratory, Taiyuan University of Science and Technology, 030024, Taiyuan, Shanxi, China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Yu |D Yang |u National Key Laboratory for Novel Software Technology, Nanjing University, 200093, Nanjing, China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/6(2015-06-01), 1461-1475 |x 1432-7643 |q 19:6<1461 |1 2015 |2 19 |o 500 | ||