模拟退火算法求解TSP问题.docVIP

模拟退火算法在TSP问题中的应用研究 PAGE PAGE 1 摘 要 旅行商问题，即TSP问题（Traveling Salesman Problem）又译为 旅行推销员问题、货郎担问题，是数学领域中著名问题之一。TSP问题是一个典型的NP 完全问题,模拟退火算法是求解此问题的一种比较理想的方法。 模拟退火算法是迭代求解策略的一种随机寻优算法，TSP问题即旅行商问题是一个组合优化问题，该问题被证明具有NPC计算复杂性。因此，研究模拟退化算法的基本原理及其在TSP问题求解中的应用受到高度的关注。 本文主要阐述了模拟退火算法的原理以及退火算法在函数优化问题上的应用和优化组合问题的研究，以便来了解TSP问题以及如何应用模拟退火算法解决实际问题上，帮助理解模拟退化算法的基本原理及其在TSP问题求解中的应用。 关键词 模拟退火算法；TSP；NPC；组合优化 ABSTRACT Into TSP problem, the problem of travelling merchants （ traveling salesman ） and the problem of travelling canvasser venterlast problem, the problem, in the field of mathematics. TSP problem famous one problem is a typical NP, impersonate all annealing algorithm is the solution of the problem of a rather ideal method. Simulation of annealing the algorithm is not an iterative the solution of a random TSP problem, this algorithm for the travel company is a combination of optimization problem. The question was shown to the complexity of the NPC. Thus, research on degradation is the basic principle of the TSP problem and solution of the application by a high degree of concern. This article focuses on the principle of simulated annealing algorithm and some of the knowledge structure what associated with the first point. By studying the principle of their algorithm, simulated annealing algorithm to optimize the application function, and optimization of research to understand the problem and the simulated annealing algorithm for TSP The practical application and research. Help to understand the basic principles of simulated annealing algorithm and its application in solving TSP problems. KEY WORDS SAA；TSP；NPC；Combinatorial Optimization 目 录 TOC \o 1-3 \h \z \u 摘 要 PAGE I ABSTRACT PAGE II 第一章 引言 2 1.1 TSP问题的基本概念 2 1.2 模拟退火算法的背景 2 1.3 发展前景 3 第二章 2.1模拟退火算法的原理 4 2.1.1 模拟退火的基本思想 4 2.1.2 算法对应动态演示步骤 4 2.2 TSP问题简述 5 第三章 问题描述与算法分析研究 6 3.1应用研究整体规划