A hybrid quantum chaotic swarm evolutionary algorithm for DNA encoding

DNA encoding is crucial to successful DNA computation, which has been extensively researched in recent years. It is difficult to solve by the traditional optimization methods for DNA encoding as it has to meet simultaneously several constraints, such as physical, chemical and logical constraints. In this paper, a novel quantum chaotic swarm evolutionary algorithm (QCSEA) is presented, and is first used to solve the DNA sequence optimization problem. By merging the particle swarm optimization and the chaotic search, the hybrid algorithm cannot only avoid the disadvantage of easily getting to the local optional solution in the later evolution period, but also keeps the rapid convergence performance. The simulation results demonstrate that the proposed quantum chaotic swarm evolutionary algorithm is valid and outperforms the genetic algorithm and conventional evolutionary algorithm for DNA encoding. (c) 2008 Elsevier Ltd. All rights reserved.