Hybrid particle swarm optimization and pattern search algorithm
Particle swarm optimization (PSO) is one of the most commonly used stochastic optimization algorithms for many researchers and scientists of the last two decades, and the pattern search (PS) method is one of the most important local optimization algorithms. In this paper, we test three methods of hy...
Saved in:
| Published in: | Optimization and engineering Vol. 22; no. 3; pp. 1539 - 1555 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer US
01.09.2021
Springer Nature B.V |
| Subjects: | |
| ISSN: | 1389-4420, 1573-2924 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Particle swarm optimization (PSO) is one of the most commonly used stochastic optimization algorithms for many researchers and scientists of the last two decades, and the pattern search (PS) method is one of the most important local optimization algorithms. In this paper, we test three methods of hybridizing PSO and PS to improve the global minima and robustness. All methods let PSO run first followed by PS. The first method lets PSO use a large number of particles for a limited number of iterations. The second method lets PSO run normally until tolerance is reached. The third method lets PSO run normally until the average particle distance from the global best location is within a threshold. Numerical results using non-differentiable test functions reveal that all three methods improve the global minima and robustness versus PSO. The third hybrid method was also applied to a basin network optimization problem and outperformed PSO with filter method and genetic algorithm with implicit filtering. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1389-4420 1573-2924 |
| DOI: | 10.1007/s11081-020-09534-7 |