A chaotic particle-swarm krill herd algorithm for global numerical optimization

Wang Gai-Ge (Jiangsu Normal University, Xuzhou, China)
Hossein Gandomi Amir (University of Akron, Akron, Ohio, USA)
Hossein Alavi Amir (Michigan State University, East Lansing, Michigan, USA)

Kybernetes

ISSN: 0368-492X

Publication date: 24 June 2013

Abstract

Purpose

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.

Design/methodology/approach

In CPKH, chaos sequence is introduced into the KH algorithm so as to further enhance its global search ability.

Findings

This new method can accelerate the global convergence speed while preserving the strong robustness of the basic KH.

Originality/value

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.

Keywords

Citation

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-0108

Download as .RIS

Publisher

:

Emerald Group Publishing Limited

Copyright © 2013, Emerald Group Publishing Limited

Please note you might not have access to this content

You may be able to access this content by login via Shibboleth, Open Athens or with your Emerald account.
If you would like to contact us about accessing this content, click the button and fill out the form.
To rent this content from Deepdyve, please click the button.