Bat algorithm for constrained optimization tasks

In this study, we use a new metaheuristic optimization algorithm, called bat algorithm (BA), to solve constraint optimization tasks. BA is verified using several classical benchmark constraint problems. For further validation, BA is applied to three benchmark constraint engineering problems reported...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Neural computing & applications Ročník 22; číslo 6; s. 1239 - 1255
Hlavní autori: Gandomi, Amir Hossein, Yang, Xin-She, Alavi, Amir Hossein, Talatahari, Siamak
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: London Springer-Verlag 01.05.2013
Springer
Predmet:
ISSN:0941-0643, 1433-3058
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this study, we use a new metaheuristic optimization algorithm, called bat algorithm (BA), to solve constraint optimization tasks. BA is verified using several classical benchmark constraint problems. For further validation, BA is applied to three benchmark constraint engineering problems reported in the specialized literature. The performance of the bat algorithm is compared with various existing algorithms. The optimal solutions obtained by BA are found to be better than the best solutions provided by the existing methods. Finally, the unique search features used in BA are analyzed, and their implications for future research are discussed in detail.
ISSN:0941-0643
1433-3058
DOI:10.1007/s00521-012-1028-9