Lévy-Flight Krill Herd Algorithm

To improve the performance of the krill herd (KH) algorithm, in this paper, a Lévy-flight krill herd (LKH) algorithm is proposed for solving optimization tasks within limited computing time. The improvement includes the addition of a new local Lévy-flight (LLF) operator during the process when updat...

Full description

Saved in:
Bibliographic Details
Published inMathematical problems in engineering Vol. 2013; no. 2013; pp. 1 - 14
Main Authors Li, Jiang, Alavi, Amir Hossein, Cao, Lihua, Gandomi, Amir Hossein, Guo, Lihong, Wang, Gai-Ge, Duan, Hong
Format Journal Article
LanguageEnglish
Published Cairo, Egypt Hindawi Publishing Corporation 01.01.2013
John Wiley & Sons, Inc
Subjects
Online AccessGet full text
ISSN1024-123X
1026-7077
1563-5147
1563-5147
DOI10.1155/2013/682073

Cover

More Information
Summary:To improve the performance of the krill herd (KH) algorithm, in this paper, a Lévy-flight krill herd (LKH) algorithm is proposed for solving optimization tasks within limited computing time. The improvement includes the addition of a new local Lévy-flight (LLF) operator during the process when updating krill in order to improve its efficiency and reliability coping with global numerical optimization problems. The LLF operator encourages the exploitation and makes the krill individuals search the space carefully at the end of the search. The elitism scheme is also applied to keep the best krill during the process when updating the krill. Fourteen standard benchmark functions are used to verify the effects of these improvements and it is illustrated that, in most cases, the performance of this novel metaheuristic LKH method is superior to, or at least highly competitive with, the standard KH and other population-based optimization methods. Especially, this new method can accelerate the global convergence speed to the true global optimum while preserving the main feature of the basic KH.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1024-123X
1026-7077
1563-5147
1563-5147
DOI:10.1155/2013/682073