Compact Bat Algorithm

Thi-Kien Dao, Jeng-Shyang Pan, Trong-The Nguyen, Shu-Chuan Chu, Chin-Shiuh Shieh

    Research output: Contribution to conferencePaperpeer-review

    22 Citations (Scopus)


    Addressing to the computational requirements of the hardware devices with limited resources such as memory size or low price is critical issues. This paper, a novel algorithm, namely compact Bat Algorithm (cBA), for solving the numerical optimization problems is proposed based on the framework of the original Bat algorithm (oBA). A probabilistic representation random of the Bat’s behavior is inspired to employ for this proposed algorithm, in which the replaced population with the probability vector updated based on single competition. These lead to the entire algorithm functioning applying a modest memory usage. The simulations compare both algorithms in terms of solution quality, speed and saving memory. The results show that cBA can solve the optimization despite a modest memory usage as good performance as oBA displays with its complex population-based algorithm. It is used the same as what is needed for storing space with six solutions.

    Original languageEnglish
    Number of pages12
    Publication statusPublished - 1 Jan 2014
    EventThe First Euro-China Conference on Intelligent Data Analysis and Applications - Shenzhen, China
    Duration: 13 Jun 201415 Jun 2014


    ConferenceThe First Euro-China Conference on Intelligent Data Analysis and Applications


    • Bat algorithm
    • Compact Bat algorithm
    • Optimizations
    • Swarm intelligence


    Dive into the research topics of 'Compact Bat Algorithm'. Together they form a unique fingerprint.

    Cite this