Multiple Quantum Spaces Based Genetic Coding Method

Multiple Quantum Spaces Based Genetic Coding Method

Tao Gao (Department of Automation, North China Electric Power University, Baoding, China)
DOI: 10.4018/ijapuc.2014040104
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Quantum genetic coding method plays an important role in improving the efficiency of optimization algorithm. The existing quantum genetic algorithm has some defects, that quantum encoding scheme is tend to reduce the stability, so that the algorithm is prone to premature convergence and falls into local minima. Therefore, the chain of multiple genes encoding scheme is used to extend in the multi-dimensional space for improving this algorithm. By function extremum and simulation of neural network weights optimization, according to the characteristics of qubits and the normalization condition, double and triple chain binding coding schemes are proposed. By experiments on multiple genes encoding scheme chain, the performance of the algorithm is tested. It shows that the algorithm can get better results by increasing the higher accuracy of solution chain genes. It is an effective strategy to improve the performance of genetic coding.
Article Preview

2. Encoding Scheme

Quantum coding are generally used Q-bit probability amplitude to encode chromosomes, which , qubit can be in a state or, gene locus state, they can also be in a superposition state, genetic bits of information can be stored and expression by qubits. Due to the gradual approximation to the state and gradual approaching to the state, it makes the quantum state of a particular chromosome to move closer, which induces the algorithm gradually with stability. Specific coding scheme is as follows:

(1)

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing