遗传算法在求解最短路径问题中的研究应用.doc

智能优化计算及应用课考核论文 第  PAGE 16 页 遗传算法在求解最短路径问题中的研究应用 摘 要 TSP 问题是典型的NP完全问题,遗传算法是求解NP完全问题的一种常用方法。本文针对解决TSP 问题,在MATLAB中用遗传算法施行对TSP问题进行了求解，进行了选择、交叉和变异算子进行了算法设计，最后在JAVA软件上进行编程实现。最后探讨了遗传算法解决旅行商问题自身具备的特点[1]。 关键词：遗传算法；TSP问题；JAVA软件 SOLVING TSP (Travelling Salesman Problem ) BASED ON GENETIC ALGORITHM Author : Zong Man-yi Tutor : Qiao Li-hong Abstract TSP( Traveling Salesman Problem) is a typical NP complete problem ,genetic algorithm is the perfect method for solving NP complete problem. This paper use genetic algorithm in the MATLAB software to solve the a typical TSP problem . It probes into the realization of genetic operator program through TSP solving by genetic algorithm , design the each function of each genetic operator(select, intercross, mutate). Finally ,We programm in Matlab language and discuss the characteristic of genetic algorithm in solving TSP Key words : genetic algorithm; TSP JAVA ;  目录  TOC \o 1-3 \h \z \u  HYPERLINK \l _Toc185778015 引言  PAGEREF _Toc185778015 \h 4  HYPERLINK \l _Toc185778016 1　 GA概述  PAGEREF _Toc185778016 \h 4  HYPERLINK \l _Toc185778017 2　旅行商问题(TSP)  PAGEREF _Toc185778017 \h 4  HYPERLINK \l _Toc185778018 3 用遗传算法解决旅行商问题  PAGEREF _Toc185778018 \h 5  HYPERLINK \l _Toc185778019 4 论文的主要构成  PAGEREF _Toc185778019 \h 5  HYPERLINK \l _Toc185778020 遗传算法的设计  PAGEREF _Toc185778020 \h 6  HYPERLINK \l _Toc185778021 1问题分析  PAGEREF _Toc185778021 \h 6  HYPERLINK \l _Toc185778022 2 总体设计  PAGEREF _Toc185778022 \h 7  HYPERLINK \l _Toc185778023 3 详细设计  PAGEREF _Toc185778023 \h 8  HYPERLINK \l _Toc185778024 3.1 　编码与随机和初始群体生成  PAGEREF _Toc185778024 \h 8  HYPERLINK \l _Toc185778025 3.2 　城市位置及距离矩阵和适应度函数  PAGEREF _Toc185778025 \h 8  HYPERLINK \l _Toc185778026 3.4 选择  PAGEREF _Toc185778026 \h 9  HYPERLINK \l _Toc185778027 3.4 交叉  PAGEREF _Toc185778027 \h 9