遗传算法解TSP问题的程序设计  

Genetic Algorithm for the Traveling Salesman Problem Program Design

作　　者：兰兆青[1] 白艳萍[1] 李飞[1] 

机构地区：[1]中北大学数学系,山西太原030051

出　　处：《太原师范学院学报（自然科学版）》2008年第2期30-32,共3页Journal of Taiyuan Normal University:Natural Science Edition

基　　金：山西省自然科学基金(20051006)

摘　　要：遗传算法是基于生物进化原理的普适性全局优化算法,针对一类NP完全的组合优化问题—旅行商问题,文章阐述了用遗传算法求解旅行商问题的算法步骤,并给出相应的程序设计.将此算法应用到6个旅行商问题中所得到的结果与弹性网络得到的结果进行比较,得出用遗传算法得到的结果与最优解较为接近的结论.Genetic algorithms are based on the universal principle of biological evolution of the global optimization algorithm for a class of NP-complete combinatorial optimization problemtraveling salesman problem, the paper using genetic algorithm for the traveling salesman problem steps algorithm, and gives the corresponding program design. This algorithm applied to the six traveling salesman problem in the results obtained by the network flexibility and compare the results obtained using the results of genetic algorithms are relatively close to the optimal solution with the conclusions.

关 键 词：遗传算法 旅行商问题 组合优化 程序设计 

分 类 号：TP183[自动化与计算机技术—控制理论与控制工程]