搜索资源列表
tsp.c
- 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes
TSP
- \"遗传算法\"以及\"退火算法\"用C++语言可以直接运行
遗传算法用于tsp问题的研究
- 此文件是用VC编写的关于编译原理遗传算法用于tsp问题的研究-this document is prepared by the VC on the principle of genetic algorithms compiled for the study tsp
蚂蚁算法
- VC++设计的蚂蚁算法在TSP问题中的应用 方便学习蚂蚁算法 -VC design Ant Algorithm in the TSP of ants facilitate learning algorithm
TSP
- 很好很重要的十进制遗传算法的源代码，C#的-Decimal very important source of genetic algorithms, C#' s
tsp
- tsp算法，遗传算法解决tsp问题，用到MATLAB编程-tsp algorithm, genetic algorithm to solve the tsp problem, use MATLAB Programming
TSP
- 是用归并排序 开发环境是C++ 算法代码经acm测试通过 -无
psotsp
- 用粒子群算法解决tsp问题,其粒子群算法为离散粒子群算法。-Using particle swarm algorithm to solve the problem tsp its discrete particle swarm PSO.
ant-tsp-ndd
- 该算法能够蚁群算法在TSP问题上的实现，能取得比较好的效果，但并非本人编写。-This programming can solving TSP problem,the effect is good ,but it is not created by me.
TSP
- 基于蒙特卡洛的TSP问题算法，方便学习使用。主要是近似算法-Based on the TSP Monte Carlo algorithm
Ga-TSP-wenti
- 用遗传算法求出TSP问题，可以再excel里换自己想要的坐标（x，y） 就可以了-TSP problem is obtained using genetic algorithms, can excel in the other they want the coordinates (x, y) on it.
genetic-algorithm-to-solve-TSP
- 用遗传算法求出TSP问题当中的问题，很好用！-TSP problem which was obtained using genetic algorithms, and easy to use!
tsp-chang
- 5个城市TSP（旅行商问题）的基于遗传算法的C++源代码，希望对于你学习遗传算法会有一定的帮助-Five cities TSP (traveling salesman problem), genetic algorithm-based C++ source code, there will be some hope for you to learn the genetic algorithm help
TSP---Matlab
- 将遗传算法用于旅行商问题求最佳路径的算法，程序简单易懂-The genetic algorithm for traveling salesman problem the optimal path algorithm, program is simple and easy to understand
TSP-ACO
- 運用蟻群演算法ACO去求解TSP旅行者路徑問題-Using ant algorithm to solve TSP travelers ACO path problem
tsp-vb
- 通过VB语言，实现TSP旅行商问题的求解，采用Ford算法实现-By VB language, to achieve for TSP Traveling Salesman Problem, using Ford algorithm
The-algorithm-of-ACA-anout-TSP
- 基于遗传算法的TSP算法程序，程序完整，下载下来即可运行-TSP algorithm based on genetic algorithm procedure is complete, you can run downloaded
chapter4
- TSP是典型的NP完全问题，既其最坏情况下的时间复杂度随着问题规模的增大按指数方式增长，到目前为止还未找到一个多项式时间的有效算法。(TSP is a typical NP complete problem, and its worst-case time complexity increases exponentially as the problem size increases. So far, no polynomial time efficient algorithm has been
禁忌算法求解tsp
- 利用禁忌搜索算法求解经典TSP问题。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Tabu search algorithm for solving classical TSP problems)
TSP双蚁群算法
- 蚁群算法是一种用来寻找优化路径的概率型算法。它由Marco Dorigo于1992年在他的博士论文中提出，其灵感来源于蚂蚁在寻找食物过程中发现路径的行为(The ant colony algorithm is a probabilistic algorithm used to find the optimal path. It was proposed by Marco Dorigo in his doctoral dissertation in 1992, inspired by the wa