Cellular bat algorithm for 0-1 programming problem.

This paper proposed cellular bat algorithm to solve 0-1 programming problem, which was based on the principles of cellular automata and bat algorithm. It used cellular and its neighbor to enhance the diversity of the searching process to improve the ability of global optimization, and transformed the constrained problem into the unconstrained problem using penalty function and then described the detailed procedures of the algorithm and programmed with MATLAB software. By some 0-1 programming problem test and comparisons with other algorithms, the results show that cellular bat algorithm has fast convergence speed and better global optimization ability. It can be used as a practical approach to solve 0-1 programming problem. [ABSTRACT FROM AUTHOR]