Solution of TSP by Quantum Genetic Algorithm

摘要：

The traditional Genetic Algorithm(GA) has large population size and excessive hereditary generations in solving TSP. To overcome the shortcomings, the traditional Genetic Algorithm was replaced with Quantum Genetic Algorithm(QGA) for solving TSP in the artical. Quantum theory is introduced into GA in QGA, so that the genetic operations are more efficient. The experiment proved that QGA can effectively resolve TSP, compared to traditional GA,having the features of smaller population size, more diverse populations,bigger searching range and faster convergence.

关键词： Quantum Genetic Algorithm TSP Genetic Algorithm

作者: LI XiaoBo

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

会议类型: 国际会议

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

会议地点: 上海

会议语种:英文

页码: 303-306

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