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

Full description

Saved in:
Bibliographic Details
Published in:Neural computing & applications Vol. 22; no. 6; pp. 1239 - 1255
Main Authors: Gandomi, Amir Hossein, Yang, Xin-She, Alavi, Amir Hossein, Talatahari, Siamak
Format: Journal Article
Language:English
Published: London Springer-Verlag 01.05.2013
Springer
Subjects:
ISSN:0941-0643, 1433-3058
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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