搜索资源列表
模拟退火算法、遗传算法求解TSP修改版2
- 模拟退火法，最新的源代码，可以解压缩后直接使用，非常方便，很适用的-simulated annealing method, the latest source code can be extracted directly after use, very convenient, very applicable
模拟退火
- 本程序用模拟退火算法实现了旅行商问题（tsp问题）-the procedures used simulated annealing algorithm to achieve the traveling salesman problem (tsp)
tsp
- 模拟退火算法通用类,改编自TSP问题求解，采用Java5范式来表示解，需要实现：评估算法，获取当前解的领域，detalT【温度变化值】，loopCount【循环次数】可调，更原始类型参看SACompute-Simulated annealing algorithm generic categories, adapted from the TSP problem solving, using Java5 solution paradigm to express the need to realiz
sa_tsp
- 旅行商（TSP）问题一直以来都是一个NP难问题，旅行商问题（TSP问题）就是一销售商从n个城市中的某一城市出发，不重复地走完其余n-1个城市并回到原出发点，在所有可能的路径中求出路径长度最短的一条。本次软件设计是利用模拟退火算法解决TSP问题，通过该软件设计，对模拟退火算法和旅行商问题有个初步的认识。-Traveling Salesman (TSP) problem has always been a NP hard problem, traveling salesman problem (TS
TSPSAwithmatlab
- TSP 问题模拟退火算法的matlab示例-TSP simulated annealing algorithm matlab example
tsp
- 模拟退火算法的解决 具体在mATlab实现算法 -matlab
mm
- 旅行商问题( TSP) 的改进模拟退火算法-Traveling Salesman Problem (TSP) to improve the simulated annealing algorithm
TSP_DESK
- TSP两种算法求解，一种是遍历所有可能路径求出最短，一种是采用模拟退火算法-TSP
TSPMatlab
- 这是一个用Matlab程序写的模拟退火算法，用于解决旅行商问题-It s a matlab code for TSP problem using SA Algorithm
munituihuo
- 模拟退火算法解决TSP问题，用固体退火模拟组合优化问题，将内能E模拟为目标函数值f，温度T演化成控制参数t，即得到解组合优化问题的模拟退火算法：由初始解i和控制参数初值t开始，对当前解重复“产生新解→计算目标函数差→接受或舍弃”的迭代，并逐步衰减t值，算法终止时的当前解即为所得近似最优解-Simulated annealing algorithm to solve the TSP problem, combined with solid-annealing simulation optimiza
tsp-ac
- 用模拟退火算法编写的解决旅行商问题的一个简单程序，所用语言为c语言。-Prepared by simulated annealing algorithm to solve traveling salesman problem with a simple procedure, the use of language c language.
TSP-based-on-improved-pso
- 基于对粒子群优化算法原理的分析，实现了一种基于TSP的改进的粒子群优化算法：求解TSP的混合粒子群算法，结合遗传算法、蚁群算法和模拟退火算法的思想来解决TSP问题。-Particle swarm optimization based on the principle of the analysis, implemented based on TSP, improved particle swarm optimization algorithm: solving the TSP hybrid pa
模拟退火算法解决tsp问题
- 设计一个可以对TSP问题进行组合优化的连续型Hopfield神经网络模型，利用该魔心可以快速的找到最优的一条路线。(A continuous Hopfield neural network model for combinatorial optimization of TSP problems is designed, which can be used to find the optimal route quickly.)
SA_TSP
- 通过模拟退火算法解决旅行商问题，具有较全的功能，改进算法可以直接加入其中(Through the simulated annealing algorithm to solve the traveling salesman problem, with full function, the improved algorithm can be directly added to them)
SAforTSP
- 模拟退火算法求解物流配送系统的tsp问题，使用MATLAB编写语言，简单易懂，适合初学者学习。(Simulated annealing algorithm for solving logistics and distribution systems TSP problem, using MATLAB programming language, easy to understand, suitable for beginners to learn.)
模拟退火
- 利用模拟退火算法 计算城市最短距离 无闭合回路tsp商旅问题求解(monituihou jiejeuchengshi zuiduanlujingwenti)
Simulated annealing algorithm
- 分析用模拟退火算法解决TSP问题时的编码方式、新解产生的方法等内容。(This paper analyzes the encoding method and new solution method of simulated annealing algorithm to solve TSP problem.)
SA_TSP
- 介绍模拟退火算法，并应用到TSP问题上。并附有小程序(Introduce simulated annealing algorithm and apply it to TSP problem. With a small program)
tsp
- matlab源代码用模拟退火算法求解TSP问题(we use SA to solve TSP problem, This is the matlab code.)