A Hyper Spherical Search (HSS) optimization algorithm based on chaos theory is proposed that resolves the weakness of the standard HSS optimization algorithm including the speed of convergence and the sequential increment in the number of algorithm iterations to achieve More
A Hyper Spherical Search (HSS) optimization algorithm based on chaos theory is proposed that resolves the weakness of the standard HSS optimization algorithm including the speed of convergence and the sequential increment in the number of algorithm iterations to achieve the optimal solution. For this, in the particle initiation and search steps of the proposed algorithm, random values used in the standard algorithm are replaced with the values of two mappings, Chebyshev and Liebovitch, that makes the results of the proposed algorithm definite and decreases their standard deviation. The simulation results on the standard benchmark functions show that the proposed algorithm not only has faster convergence, but also acts as a more accurate search algorithm to find the optimal solution in comparison to standard hyper spherical search algorithm and some other optimization algorithms such as genetic, particle swarm, and harmony search algorithm.
Manuscript profile
