A Method for Routing Based on Quantum Genetic Algorithm
Lijuan Sun · Computer Technology and Development · 2006
There exists many design and optimization problems in network,and parts of them belong to NP type.Traditional methods can't resolve these problems because of large computation complexity.The routing problem is one of these problems.This paper discusses a new solution for the routing problem.In this paper,the mathematical model of the routing problem is introduced.Then the quantum genetic algorithm and its application in the routing problem are investigated deeply.At last,a computer simulation is carried out.As can be seen from the outcome of the simulation experiment,the quantum genetic algorithm gains an advantage over the conventional genetic algorithm.Its search speed is faster and its efficiency is higher.Furthermore,it has stronger practicality and robustness.