To improve the performance of the krill herd (KH) algorithm, in this paper, a series of chaotic particle-swarm krill herd (CPKH) algorithms are proposed for solving optimization tasks within limited time requirements. The paper aims to discuss these issues.
In CPKH, chaos sequence is introduced into the KH algorithm so as to further enhance its global search ability.
This new method can accelerate the global convergence speed while preserving the strong robustness of the basic KH.
Here, 32 different benchmarks and a gear train design problem are applied to tune the three main movements of the krill in CPKH method. It has been demonstrated that, in most cases, CPKH with an appropriate chaotic map performs superiorly to, or at least highly competitively with, the standard KH and other population-based optimization methods.
Wang, G., Hossein Gandomi, A. and Hossein Alavi, A. (2013), "A chaotic particle-swarm krill herd algorithm for global numerical optimization", Kybernetes, Vol. 42 No. 6, pp. 962-978. https://doi.org/10.1108/K-11-2012-0108Download as .RIS
Emerald Group Publishing Limited
Copyright © 2013, Emerald Group Publishing Limited