Genetic Algorithm Based on Cellular Automata with Disturbances

This paper describes a kind of improved algorithm called the Cellular Genectic Algorithm with Disturbances. It can be regarded as a hybrid between a fine-grained and a coarse-grained parallel genetic algorithm. Based on the idea of Cellular Algorithm and the principle of Cellular Automata, the introduction of a "disturbance-colonisation" cycle can be used for solving the optimiza-tion problem of complicated function, which gives promising results.