搜索资源列表
genetic_algorithm-Solve-the-TSP-problem
- 基于遗传算法的50个城市TSP问题的求解,可推广至类似NP-hard问题。-Genetic Algorithm Based on 50 cities TSP problem solving can be extended to a similar NP-hard problem.
ant_colony_system-Solve-the-TSP-problem
- 基于蚁群算法的50个城市TSP问题的求解,可推广至类似NP-hard问题。-Ant colony algorithm based on the 50 cities TSP problem solving can be extended to a similar NP-hard problem.
TSP
- 应用Hopfield神经网络求解TSP问题 在VC++环境下编程 -using hopfield network solve the problem of TSP.
TSP
- 蚁群算法求解TSP问题的源程序及简要说明-Ant Colony Algorithm for TSP problem and a brief descr iption of the source
TSP
- 介绍求解TSP 问题的蚁群算法,是解决旅行售货员问题的一种比较好的方法-Introduced to solve the ant colony algorithm for TSP problem is to solve the traveling salesman problem of a better way to
TSP
- 模拟退火算法来源于固体退火原理,将固体加温至充分高,再让其徐徐冷却,加温时,固体内部粒子随温升变为无序状,内能增大,而徐徐冷却时粒子渐趋有序,在每个温度都达到平衡态,最后在常温时达到基态,内能减为最小。根据Metropolis准则,粒子在温度T时趋于平衡的概率为e-ΔE/(kT),其中E为温度T时的内能,ΔE为其改变量,k为Boltzmann常数。用固体退火模拟组合优化问题,将内能E模拟为目标函数值f,温度T演化成控制参数t,即得到解组合优化问题的模拟退火算法:由初始解i和控制参数初值t开始,
TSP
- 用C++实现遗传算法求解TSP问题.txt-C++ for TSP
TSP
- 混合蛙跳文章 混合蛙跳算法求解TSP问题.pdf-Articles Hybrid Hybrid Leapfrog Leapfrog algorithm to solve TSP problems. Pdf
Tsp--SA
- 基于sa求解的tsp问题,绝对可以执行,请放心下载。-Based sa problem solving tsp absolutely can perform, please be assured to download.
TSP-InvertOver
- 采用Inver-over算法求解TSP问题(包括测试算例),算法结果较好,收敛较快。-This algorithm introuduce the Inver-over operotor that is solved TSP problems.(Including testing benchmarks).
lvxingshangwenti
- 旅行商问题,即TSP问题(Traveling Salesman Problem)是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路经的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 TSP问题是一个组合优化问题。该问题可以被证明具有NPC计算复杂性。因此,任何能使该问题的求解得以简化的方法,都将受到高度的评价和关注。 -Traveling salesman problem, the T
GA-TSP
- GA-TSP 运用遗传算法求解TSP问题,需要分开函数保存在运行。-GA-TSP the use of genetic algorithm to solve TSP problem and needs to separate the function is saved in the running.
TSP
- 利用遗传算法求解旅行商问题 旅行商问题,即TSP问题(Travelling Salesman Problem)是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路经的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling salesman problem using genetic algorithm traveling salesman problem, namely, th
TSP
- 用穷举法和模拟退火方法实现了求解tsp问题-With exhaustion and simulated annealing method for solving TSP problem
ant-for-tsp-pr76
- 基于蚁群算法用MATLAB求解76城市TSP问题,可得目前世界最优解,适合高手阅读使用-Using MATLAB based on ant algorithm for solving the problem of 76 cities TSP, the best solution available to the world for master read the
TSP
- 蚁群算法求解TSP问题,附详细说明,适合初学者使用,此程序100 可用-ACO Ant Colony Optimization Artificial Intelligence
swarm_optimization-Solve-the-TSP-problem
- 一个基于粒子群优化算法源码,(PSO)的50个城市TSP问题的求解,可推广至类似NP.-A source code based on particle swarm optimization, (PSO) of the 50 cities TSP problem solving, can be extended to similar NP.
TSP
- 旅行商问题求解, 采用LINGO语言实现旅行商问题的求解程序-TSP Problem, Lingo source code, Tsp Lingo source code, free code
many-methods-to-solve-TSP
- 多种方式求解TSP问题,有遗传算法,A*算法,D算法,模拟退火,神经网络等-A variety of ways to solve TSP problem, a genetic algorithm, A* algorithm, D algorithm, simulated annealing, neural networks
TSP
- 用遗传算法、神经网络、蚁群算法等职能算法求解TSP问题-Using genetic algorithms, neural networks, ant colony algorithm for solving TSP problems and other functional