Krill herd: A new bio-inspired optimization algorithm
► A new bio-inspired algorithm, namely krill herd (KH) is proposed for global optimization. ► The time-dependent position of the krill individuals is formulated by three main factors. ► The KH algorithm has a better performance than well-known methods in the literature. In this paper, a novel biolog...
Uložené v:
| Vydané v: | Communications in nonlinear science & numerical simulation Ročník 17; číslo 12; s. 4831 - 4845 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.12.2012
|
| Predmet: | |
| ISSN: | 1007-5704, 1878-7274 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | ► A new bio-inspired algorithm, namely krill herd (KH) is proposed for global optimization. ► The time-dependent position of the krill individuals is formulated by three main factors. ► The KH algorithm has a better performance than well-known methods in the literature.
In this paper, a novel biologically-inspired algorithm, namely krill herd (KH) is proposed for solving optimization tasks. The KH algorithm is based on the simulation of the herding behavior of krill individuals. The minimum distances of each individual krill from food and from highest density of the herd are considered as the objective function for the krill movement. The time-dependent position of the krill individuals is formulated by three main factors: (i) movement induced by the presence of other individuals (ii) foraging activity, and (iii) random diffusion. For more precise modeling of the krill behavior, two adaptive genetic operators are added to the algorithm. The proposed method is verified using several benchmark problems commonly used in the area of optimization. Further, the KH algorithm is compared with eight well-known methods in the literature. The KH algorithm is capable of efficiently solving a wide range of benchmark optimization problems and outperforms the exciting algorithms. |
|---|---|
| Bibliografia: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 1007-5704 1878-7274 |
| DOI: | 10.1016/j.cnsns.2012.05.010 |