%0 Conference Proceedings
%T Using Bat Algorithm with Levy Walk to Solve Directing Orbits of Chaotic Systems
%+ Tongji University
%+ Taiyuan University of Technology
%A Cai, Xingjuan
%A Wang, Lei
%A Cui, Zhihua
%A Kang, Qi
%Z Part 1: Machine Learning
%< avec comité de lecture
%( IFIP Advances in Information and Communication Technology
%B 8th International Conference on Intelligent Information Processing (IIP)
%C Hangzhou, China
%Y Zhongzhi Shi
%Y Zhaohui Wu
%Y David Leake
%Y Uli Sattler
%I Springer
%3 Intelligent Information Processing VII
%V AICT-432
%P 11-19
%8 2014-10-17
%D 2014
%R 10.1007/978-3-662-44980-6_2
%K Bat algorithm
%K Levy walk
%K chaotic system
%Z Computer Science [cs]Conference papers
%X Bat algorithm is a novel swarm intelligent version by simulating the bat seeking behavior. However, due to the poor exploitation, the performance is not well. Therefore, a new variant named bat algorithm with Gaussian walk is proposed in which the original uniform sample manner is replaced by one Gaussian sample. In this paper, we want to further investigate the performance with Levy sampling manner. To test its performance, three other variants of bat algorithms are employed to compare, simulation results show our modification is superior to other algorithms.
%G English
%Z TC 12
%2 https://inria.hal.science/hal-01383311/document
%2 https://inria.hal.science/hal-01383311/file/978-3-662-44980-6_2_Chapter.pdf
%L hal-01383311
%U https://inria.hal.science/hal-01383311
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-AICT-432
%~ IFIP-TC12
%~ IFIP-IIP