摘要： 通过混合使用多种杂交算子,提出了一种求解旅行商问题的新型遗传算法,并给出了实验验证。通过实验用该算法求解了城市数为50到100不等的旅行商问题,获得了比其它算法更精确或更接近最优的解,表明了算法的有效性。

关键词: 混合杂交, 遗传算法, 旅行商问题

Abstract: A new genetic algorithm based on hybrid crossovers for traveling salesman problems is proposed,and an example is given to demonstrate the algorithm.The proposed algorithm by experiment is used to solve the traveling salesman problems with 50 to 100 cities and can find more accurate or closer-to-optimal solutions than other algorithms.This shows the effectiveness of the proposed algorithm.

中图分类号: 

• TP18