Seeker Optimization Algorithm for Several Practical Applications

DOI

10.1080/18756891.2013.864476How to use a DOI?

Keywords

Seeker optimization algorithm, PID controller design, IIR digital filter design

Abstract

Optimization problems can often be simplified to the search for an optimal solution in the feasible search space. Based on the concept of simulating the act of human randomized search, a novel algorithm called seeker optimization algorithm (SOA) for real-parameter optimization is proposed in this paper. In the SOA, after given center point, search direction, search radius, and trust degree, every seeker moves to a new position (a candidate solution) from his current position based on his historical and social experiences. In this process, the update formula is like Y-conditional cloud generator. The algorithm's performance was studied using several typically complex functions. In all cases studied, SOA is superior to continuous genetic algorithm (CGA) greatly in terms of optimization quality, robustness and efficiency. At the same time, SOA greatly outperforms particle swarm optimization (PSO) in convergence speed. However, SOA needs more computation time. Simulations of designing both PID controller and IIR digital filter also show that SOA gets more satisfactory solutions with better evaluation values.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - JOUR
AU  - Yunfang Zhu
AU  - Chaohua Dai
AU  - Weirong Chen
PY  - 2014
DA  - 2014/04/01
TI  - Seeker Optimization Algorithm for Several Practical Applications
JO  - International Journal of Computational Intelligence Systems
SP  - 353
EP  - 359
VL  - 7
IS  - 2
SN  - 1875-6883
UR  - https://doi.org/10.1080/18756891.2013.864476
DO  - 10.1080/18756891.2013.864476
ID  - Zhu2014
ER  -