搜索资源列表
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.
TSP
- 这是一个货郎担问题的动态规划代码,是C语言版的,能在TC上和VC++6.0上运行.加入了许多注释.-This is a traveling salesman problem dynamic programming code, is a C language version, can TC and VC++ 6.0 run. Adding a lot of notes.
mtsp_ga
- 由matlab解决多旅行商问题，并且包括矩阵计算等功能-From matlab to solve multi-traveling salesman problem, and includes features such as matrix calculation
hopfield
- 基于Hopfield神经网络解决旅行商问题，学习模式识别的朋友可以参考-Based on the Hopfield neural network to solve traveling salesman problem, pattern recognition learning can refer to a friend
pso_NEW_1
- 运用多目标蚁群算法求解旅行商问题，很好的一个程序。-The use of multi-objective Ant Colony Algorithm for Solving Traveling Salesman Problem, a good one.
tsp-ga.m
- sovling TSP(Travelling Salesman Problem) with GAs -sovling TSP (Travelling Salesman Problem) with GAs
TS-TSP
- 使用禁忌搜索算法求解TSP（旅行商问题）的JAVA源程序-The use of tabu search algorithm for solving TSP (Traveling Salesman Problem) the JAVA source code
Astar_TSP
- 用A星算法解决旅行商（货郎担）问题，附设计报告和测试用例-A Star algorithm used to solve TSP (traveling salesman) problems, with the design of reports and test cases
stock
- have recently become very interested in the area of genetic algorithms and Ant Colony Optimization techniques. I was determined to write a complete program demonstrating these two techniques. In particular I wanted to co
tsp
- 利用模拟退火算法解决旅行商问题，共二十个城市，选择最优路径-The use of simulated annealing algorithm to solve traveling salesman problem
TSM
- This program gives solution to the Travelling Salesman problem (TSP). I use genetic algorithm, tabu search, exhaustive search. It all combine in a windows application.
SA_TSP
- 旅行商问题（Travelling Salesman Problem, 简记TSP，亦称货郎担问题)：设有n个城市和距离矩阵D=[dij]，其中dij表示城市i到城市j的距离，i，j=1，2 … n，则问题是要找出遍访每个城市恰好一次的一条回路并使其路径长度为最短。-TSP (Travelling Salesman Problem, Jane Hutchison TSP, also known as the traveling sales
algorithm02
- heuristic algotrihm for travelling salesman problem
NNHTSP
- a nearest neighbor heuristic solving travelling salesman problem. it is great. h-a nearest neighbor heuristic solving travelling salesman problem. it is great. hehehhehehhee
mtsp_ga
- matlab多旅行商问题以及各种算法如蚂蚁算法和遗传算法-matlab multi-traveling salesman problem and various algorithms such as the ant algorithm and genetic algorithm
HybridalgorithmbasedonabalancedstudyofMTSP
- 基于混合算法的均衡路程MTSP研究 给出了MTSP的整数线性规划模型、分类, 提出了均衡各旅行商访问路程和均衡各旅行商访问人数的多目标 问题针对均衡各旅行商访问路程的设计了相应的求解算法, 求解算法为遗传算法和一的混合算法给出了相应 的示例和实验结果, 并对实验结果的有效性进行了研究-Hybrid algorithm based on a balanced study of MTSP given distance of th
Multi-travelingsalesmanproblem
- 多旅行商问题是单旅行商问题的扩展, 具有更广泛的实际意义。在研究M TSP 解的特点的基础上, 提 出了最小化总行程和均分多个旅行商访问点数、最小化总行程及均分访问路程的两个多目标的M TSP 问题, 并分别给出了相应的数学模型、求解算法和应用实例, 实例表明模型的正确性。-Multi-traveling salesman problem traveling salesman problem is a single expans
TSPMATLAB
- 遗传算法求解TSP问题的MATLAB实现。这是一篇非常有新意的论文，对于学习遗传算法非常有用-This paper has resolved the traveling salesman problem(TSP) by virtue of geneitc algorithms(GA)
BruteForceGuilherme.java
- Brute force solution for the traveling salesman problem