A New Cellular Automata-Based Mixed Cellular Ant Algorithm for Solving Continuous System Optimization Programs

Ant colony algorithm is a kind of bionic algorithm which sources from the behaviors of the ant colony. Based on the idea of ant algorithm and the principle of cellular automata, this paper develops a new mixed cellular ant algorithm and its mathematical description that can be used for solving the optimization programs of continuous systems. By using the method, the ideal searching direction of global optimal solution could be found as soon as possible. The algorithm is coded in MATLAB, and is tested through series of typical optimization problem instances. The experiment indicates that the improved and mixed cellular ant algorithm improves the efficiency of searching and veracity of result.