解 TSP 的有序遗传算法

An Ordered Genetic Algorithm for Solving Traveling Salesman Problem

根据生物进化原理，提出了一种求解ＴＳＰ的有序遗传算法。利用有序编码规则，通过有序交叉算子和有序变异算子的作用，保证该算法不仅能获得ＴＳＰ的有效解，而且能可靠地获得全局最优解。计算机模拟实验表明，该算法具有收敛速度快，易获得最优解等特点。

A new algorithm, ordered genetic algorithm (OGA),for solving traveling salesman problem (TSP) is proposed based on the principle of biological evolution and by employing the order based code rule, order based crossover and order based mutation.With OGA,not only can legal tours be achieved but also can the global minimum be obtained.The simulation results show that OGA has the advantages in fast convergence and ease in getting the optimum.