搜索资源列表
08100354294
- 用遗传算法解决旅行商问题 -惴ㄅ?糯惴
multisp
- 使用MPI编写一个并行程序，利用遗传算法来解决旅行商问题。-The use of MPI to prepare a parallel process, the use of genetic algorithm to solve the traveling salesman problem.
dp_tsp
- TSP问题的动态规划求解。问题描述：旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -TSP dynamic programming to solve the problem. Descr iptio
tsp
- 用C语言实现旅行商问题。该算法简单精悍，效率也不低，是实现TSP问题的很好的算法。-Using C language realize traveling salesman problem. The algorithm is simple and lean, efficiency is not low, the problem is to achieve a good TSP algorithms.
map
- 关于旅行商问题的动态规划算法 在vc环境下编译通过-On the traveling salesman problem dynamic programming algorithm in vc compiler environment through
tsp
- 利用动态规划算法 vc实现的小规模旅行商问题-Vc algorithm using dynamic programming to achieve small-scale traveling salesman problem
tspGA
- 采用遗传算法解决ＴＳＰ旅行商问题 对初学遗传算法者很不错-The use of genetic algorithm to solve traveling salesman problem TSP to the beginner who is pretty good genetic algorithm
acatsp
- 利用蚂蚁算法思想,求解旅行商问题!思路清晰,有注解,适合初学者学习!-Thinking of the use of ant algorithm to solve traveling salesman problem! Clear lines of thought, have comments, suitable for beginners to learn!
AntTsp
- 解决旅行商问题的C++代码，可以欣赏以下-Solve the Traveling Salesman Problem C++ Code, you can enjoy the following
SATSP
- 用模拟退火算法求解旅行商问题 T(t+1)＝k×T(t) 式中k为正的略小于1.00的常数，t为降温的次数 -Using Simulated Annealing Algorithm for Solving Traveling Salesman Problem T (t+ 1) = k × T (t) where k is slightly less than 1.00 are constants, t is the numbe
GATSP
- 用遗传算法求解旅行商问题的matlab程序 （详细说明见文本）-Using Genetic Algorithm for Traveling Salesman Problem matlab program (a detailed explanation see the text)
LINGO1
- lingo 多旅行商问题的求解代码 每人限制运货为50-multi-lingo code for solving the traveling salesman problem restricted shipments of 50 per person
TSPgenerationwithMatlab
- TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序,可用于解决夺目的地TSP问题-TSP problem (also known as: traveling salesman problem, traveling salesman problem) genetic algorithm matlab general procedures can be used to solve TSP problems capture
TSP40
- 旅行商问题 tsp-Traveling salesman problem tsp
TravelerField
- 本程序使用MFC编写了编写了旅行商问题，使用A*算法。-This procedure was prepared to use MFC to prepare a traveling salesman problem, use the A* algorithm.
FISHTSP
- 人工鱼群算法解决旅行商问题,这是在当前互联网上唯一的一个,这个是我自己编的,保证通过-Artificial fish-swarm algorithm to solve traveling salesman problem, which is in the current Internet, the only one, this is my own, and to ensure through
DXTSP
- 单向的TSP旅行商问题的动态规划算法，用C语言实现。-One-way Traveling Salesman Problem TSP dynamic programming algorithm, using C language.
101259373DeMat
- 一些pso算法的应用 解决旅行商问题-Application of some PSO algorithm to solve traveling salesman problem
trav
- 求解TSP（旅行商）问题的模拟退火程序，能够解决任意维数的TSP及组合优化问题，得到的结果优化程度都很高-Solving TSP (TSP) in simulated annealing procedures, can solve arbitrary dimension TSP and combinatorial optimization problems, the result of optimization of a high de
TSP
- tsp（旅行商问题） 利用matlab遗传算法、模拟退火算法以及lingo动态规划求解-tsp (TSP) using matlab genetic algorithms, simulated annealing algorithm and dynamic programming to solve lingo