%0 Journal Article
%T A hybrid parallel genetic algorithm and its application to TSP<br>混合并行遗传算法求解TSP问题
%A Dai Xiaoming
%A Zou Runmin
%A Feng Rui
%A Zhang Hongyuan
%A Shao Huihe
%A <br>戴晓明
%A 邹润民
%A 冯瑞
%A 张洪源
%A 邵惠鹤
%J 电子与信息学报
%D 2002
%I 
%X This paper applies a multiple population Genetic Algorithm (GA) to solving the TSP (Traveling Salesman Problem). Different populations apply different mutation factors to achieve different search objects. The transition factor among the groups is used to solve the premature convergence problem under some circumstances. It accelerates search process in state space. The experimental results show that this algorithm has great advantage of convergence property over canonical genetic algorithm.
%K Genetic algorithm
%K Multiple population
%K Transition factor
%K Convergence property
%K TSP<br>混合并行
%K 遗传算法
%K 求解
%K TSP
%K 多种群
%K 迁移算子
%K 收敛
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=946E4CAA04ACC990&yid=C3ACC247184A22C1&vid=B91E8C6D6FE990DB&iid=F3090AE9B60B7ED1&sid=AFD02B86BFB3C7FC&eid=83F3E1555B654B95&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=2&reference_num=6