搜索资源列表
一些解决TSP问题的算法及源代码模拟退火算法
- 一些模拟退火算法及元代码,可以用于解决TSP问题的等，我已经验证过了 可以的，速度比较快，大家可以下载试试！ -some simulated annealing yuan and the code can be used to solve problems such as TSP, I can be tested, and faster speed, you can download a try!
AntTSP
- tsp问题的蚂蚁算法-ant colony algorithm for TSP problem
一些解决TSP问题的算法及源代码模拟退火算法
- 一些模拟退火算法及元代码,可以用于解决TSP问题的等，我已经验证过了 可以的，速度比较快，大家可以下载试试！ -some simulated annealing yuan and the code can be used to solve problems such as TSP, I can be tested, and faster speed, you can download a try!
遗传算法解TSP
- 实现用固定变异概率和自适应变异概率解tsp问题的比较，自适应式算法采用基于种群差异度的自适应算法，详见实验报告-achieve fixed mutation probability and Adaptive Solutions tsp mutation probability of comparison, Adaptive Algorithm-based differences in the populations adaptive a
eil51
- 在http://elib.zib.de/pub/Packages/mp-testdata/tsp/tsplib/tsp/上下载eil51地图，以eil51.tsp与源程序存在一起-at http :// elib.zib.de/pub/Packages/mp- testdata/t sp/tsplib/tsp/eil51 download maps, eil51.tsp to exist together with the source
tsp
- tsp问题俗称旅行商问题，一个商人从一个城市出发，经过所有的城市一次且仅一次回到出发的城市，问旅行商应当如何选择路径使总路径最短。本程序是用lingo软件编写的，只需要更改城市的数目以及距离矩阵即可。-tsp problem commonly known as the traveling salesman problem, a businessman from a city of departure, after all of the
TSP
- "遗传算法"以及"退火算法"用C++语言可以直接运行-Genetic algorithm as well as the annealing algorithm C++ Language can be directly run
TSP
- 包括蚁群，模拟退火，遗传，神经网络，禁忌搜索等智能优化算法对TSP问题的解决。-Including ant colony, simulated annealing, genetic, neural networks, tabu search, such as intelligent optimization algorithm to TSP problem.
TSP(TravelingSalesmanProblem)
- Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a numb
tsp
- 通过神经网络，蚁群算法，遗传算法等智能优化方法解决TSP问题-Through neural networks, ant colony algorithm, genetic algorithm, such as intelligent optimization methods to solve TSP problems
Basi-An-Colony-Algorithm-fo-TSP
- 段海滨教授主编的《蚁群算法原理及其应用》附录里的C程序代码-Professor Duan Haibin editor-in-chief of
TSp
- cost存放了一个强连通图的边权矩阵，作为一个实例。 可在workspace中加载 运用此算法要注意多次试验。 bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到
standard-PSO
- 标准的pso 程序，可用于tsp 等优化问题，大家分享交流 共同进步。-Standard PSO procedure, can be used for optimization problems, such as tsp, we shared the common progress.
TSP
- 遗传算法实现TSP算法，包括选择、交叉等操作-TSP algorithm for genetic algorithm implementation, including selection, crossover, such as operation
AntTSP
- TSP问题关于蚁群最优化算法的MATLAB程序-Ant colony optimization about TSP algorithm of MATLAB
TSP
- 回溯法解决TSP问题，对于任何的无向图，只要存在回路均可找到，无回路也可检测出来！-Backtracking to solve TSP problem, for any undirected graph, loop as long as there can be found, no loop can be detected!
TSP
- 旅行商问题（Traveling Saleman Problem，TSP）又译为旅行推销员问题、货郎担问题，简称为TSP问题，是最基本的路线问题，该问题是在寻求单一旅行者由起点出发，通过所有给定的需求点之后，最后再回到原点的最小路径成本。采用回溯法，邻点法实现，有图形界面。-TSP (Traveling Saleman Problem, TSP) also translated as traveling salesman problem,
tsp
- 实践证明，遗传算法对于解决TSP问题等组合优化问题具有较好的寻优性能。-Practice has proved that a combination of genetic algorithms for solving optimization problems such as TSP problem has better optimization performance.
TSP问题代码
- 本文是以旅行商问题为研究点，利用蚂蚁算法优化求解最短路径，平台工具是具有绘图功能的matlab软件。(This paper takes traveling salesman problem as the research point, and uses ant algorithm to optimize the shortest path. The platform tool is matlab software with drawin
基于遗传算法的 TSP 算法
- tsp问题（全称：TravellingSalesmanProblem），又称为旅行商问题、货郎担问题、TSP问题，是一个多局部最优的最优化问题，遗传算法是一种基于种群演变一种优化的算法，在此基础上的优化程序会自动寻找出最短路(TSP (full name: TravellingSalesmanProblem), also known as the traveling salesman problem, traveling salesma