Abstract
Difficulties of tackling real-world problems with their growing complexities motivated computer scientists to search for more efficient problem solving approaches. Metaheuristic algorithms are outstanding examples of these ap-proaches. Bat Algorithm (BA) is a new meta-heuristic optimization algorithm, which has been developed rapidly and has been applied in different optimization tasks in recent years. In this paper an improved version of Bat algorithm with chaos is represented. The approach is based on the substitution of the random number generator (RNG) with chaotic sequences for parameter initialization. Simulation results on some mathematical benchmark functions demonstrate the validity of proposed algorithm, in which the Chaotic Bat Algorithm (CBA) outperforms the classical BA.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
