International Symposium on Information Science and Engineering

Network Optimization Method Based on Improved Quantum Genetic Algorithm

Xin Fan, Wei Li, Zhihuan Chen, Jun Jie Yi

Published Dec 1, 2012• 2 citations

Abstract

To solve structure optimization problems of the information transmission networks, based on quantum genetic algorithm (QGA), the paper proposes an improved quantum genetic algorithm (IQGA). The core of the algorithm is to take full advantage of interference and entanglement of quantum states, through adopting the quantum gates rotation corner dynamic adjusting mechanism, quantum crossover and mutation operations, genetic operation parameters dynamic adaptive adjustment mechanism and solution elites control strategy. The algorithm has better performance in solving combinatorial optimization problems of the weak correlation between genes.

DOI: 10.1109/isise.2012.101

Related papers

A Novel Improved Quantum Genetic Algorithm for Combinatorial Optimization Problems

Xihua Zou

Based on quantum genetic algorithm(QGA),a novel improved quantum genetic algorithm(NIQGA)to solve combinatorial optimization problem is proposed.To make full use of interference and entanglement characteristics of quantum state,dynamic step length in adjustment of angle of quantum gate,quantum crossover operation and quantum mutation operation are introduced,therefore high efficiency for optimization is achieved.Two typical combinatorial optimization problems—0/1 knapsack problem and route selection problem,are adopted to confirm the performance of NIQGA.Experimental results show that compared with GA and QGA,NIQGA is characterized by fast convergence rate and excellent capability on global optimization,especially better performance for combinatorial optimization problem with less correlation of genes.

Dianzi xuebaoJan 1, 200715 citations

An Improved Quantum Genetic Algorithm

Bo Yang

This paper suggests an improved quantum genetic algorithm(IQGA).In encoding,a kind of encoding method to determine the quantum chromosome gene length is advanced in terms of accurate dynamics of the problem to be found out.This encoding method takes the equilibrium relations between the calculation solution accuracy and seeking for efficiency into consideration.Also,this paper discusses the dynamic adjustment and tactics of quantum rotation angle,whereby making operator realize the combination of a kind of rough searching with the fine searching under the different cases.The combination of quantum mutation operation can render the postmutation to be able to carry out searching in a larger neighborhood range in such a way that the algorithm is ensured to search for a solution with high accuracy within a rational calculation cost.In the end,IQGA is used to test several selected standard base functions.The tested results indicate that IQGA can obtain the best solusion,the best average value and convergence algebra as against the existing algorithm data cited in literature,and with a certain advantage.

Journal of Xi'an University of TechnologyJan 1, 20122 citations

Improvement of Quantum Genetic Algorithm and Its Application

Ge ZHANG

An improved quantum genetic algorithm(IQGA) was proposed to overcome the shortcoming of the quantum genetic algorithm(QGA),i.e. local optimization, when it is used for the optimization of continuous functions with many extreme values. In IQGA, the strategies of updating quantum gate using the best solution obtained and population catastrophe were adopted. The test results for two typical functions show that the convergence speed of IQGA is faster than that of QGA, and IQGA can converge in a global solution space, overcoming the shortcoming of QGA. The application results indicate that IQGA is better than QGA and other genetic algorithms.

Journal of Southwest Jiaotong UniversityJan 1, 200312 citations

Information Technology in an Improved Quantum Genetic Algorithm Based on Dynamic Adjustment of Quantum Rotation Angle

Hui Xia Li, Yun Xue, Jian Qiang Zhang +1 more

To overcome the shortcomings of precocity and being easily trapped into local optimum of the standard quantum genetic algorithm (QGA) , Information Technology in An Improved Quantum Genetic Algorithm based on dynamic adjustment of the quantum rotation angle of quantum gate (DAAQGA) was proposed. Mutation operation using the quantum not-gate is also introduced to enhance the diversity of population. Chaos search are also introduced into the modified algorithm to improve the search accuracy. Simulation experiments have been carried and the results show that the improved algorithm has excellent performance both in the preventing premature ability and in the search accuracy.

Advanced materials researchDec 1, 20131 citation

An Improved Quantum Genetic Algorithm

Jian Bao Guo, Lijuan Sun, Ruchuan Wang +1 more

Quantum genetic algorithm (QGA) is the combination between genetic algorithm and quantum computing. In this paper, a chromosome of the standard QGA is seen as a node and the chromosome population is regarded as a network. Then the reasons for the prematurity and the stagnation of the standard QGA are analyzed from the perspective of network structure. To solve the two problems, an improved quantum genetic algorithm (IQGA) based on the small world theory is proposed. In IQGA, chromosomes encoded with qubits are divided into some sub-groups and the NW network model is introduced into the population structure. When updating chromosomes, an optimal chromosome in locality or in other sub-groups is chosen based on a certain probability as the evolution target for each chromosome. The new network structure of the chromosome population has a relatively moderate clustering coefficient and is favorable to the diversity of individual chromosomes. Tests of three classic functions prove the effectiveness and superiority of IQGA.

International Conference on Genetic and Evolutionary ComputingOct 1, 200922 citations

Quantum Entanglement Genetic Algorithm

Jincheng Zhang

This paper proposes a novel approach to optimization problems by integrating quantum entanglement with the Genetic Algorithm (GA). The core idea is to leverage the inherent parallelism and enhanced information transfer capabilities of quantum entanglement to significantly improve the search performance of the GA. We represent genetic algorithm chromosomes as quantum states and employ quantum entanglement to facilitate rapid information exchange and crossover operations across multiple qubits. This mechanism allows for parallel exploration of the search space, mitigating the limitations of traditional GA's tendency towards local optima. The theoretical framework and the underlying principles are presented, demonstrating the potential for the Quantum Entanglement Genetic Algorithm (QGA) to accelerate the solution of complex optimization problems. The algorithm's effectiveness is discussed through a mathematical formulation, focusing on the key components of the QGA and its advantages over conventional GA. The ultimate goal is to demonstrate a robust and efficient method for tackling challenging optimization tasks.

Sep 7, 20260 citations