摘要
单亲遗传算法具有操作简单、收敛较快等优点,因此被用于求解各种组合优化问题。针对旅行商问题,在早期单亲遗传算法的基础上引入了基因段贪心替换、基于相似度的家族竞争等一些控制策略,提出了一种新型、高效的单亲遗传算法。实验表明,该算法不仅能够保留收敛较快等优点,而且具备了比现有的单亲遗传算法以及改进的GT算法更强的全局寻优能力。
A new improved Partheno-Genetic Algorithm（IPGA）is presented for solving TSPs.The original Partheno-Genetic Algorithm（PGA）provides simple operators and a fast solution to lots of combinatorial optimization problems,but it may suffer from local convergence and solution quality problems.Based on the weaknesses of the original PGA,IPGA integrates the original genetic operators of PGA and a new genetic operator which is called greedy gene replacing,through similarity-based family competition and other mechanisms.Then it is evaluated on several TSPs.Experimental results indicate that IPGA is a more efficient method for TSPs and its global search performance is better than other PGAs and the improved GT algorithm（IGT）.
出处
《计算机工程与科学》
CSCD
2007年第2期89-92,109,共5页
Computer Engineering & Science
关键词
单亲遗传算法
组合优化
TSP
家族竞争
partheno-genetic algorithm,combinatorial optimization,TSP,family competition
