Improved Quantum Genetic Algorithm for Solving TSP

摘要：

General Quantum Genetic Algorithm(QGA) havnt the crossover operations, easy to fall into local optimum.For sovling TSP, the improved Quantum Genetic Algorithm can avoid the occurrence of local optimum for using crossover operation in the paper;Otherwise,the adjusting method of the rotation angle have nothing to do with the problem so it have better adaptability in solving TSP.The improved QGA, which contrails the hybrid process through setting hybrid threshold and hybrid probability in the quantum hybrid process, maintains population multiple well at the same time speed up populations convergence rate. The experiment proves this improved QGA have the features of small population scale and quick contraction speed,and can well solve the TSP.

关键词： Quantum Genetic Algorithm TSP improved

作者: Li XiaoBo

作者单位: School of Computer And Communication Engineering,Weifang University, Weifang ,China

会议类型: 国际会议

会议名称: 2010 International Conference on Circuit and Signal Processing(2010年电路与信号处理国际会议 ICCSP 2010)

会议地点: 上海

会议语种:英文

页码: 482-485

在线出版日期: 2010-12-25（万方平台首次上网日期，不代表论文的发表时间）