搜索资源列表
旅行商问题
- 旅行商问题
xunlu2hi
- 数学建模\98B 题灾情巡视路线求解程序(多旅行商)-mathematical modeling \ 98B disaster inspection line that the solver (MTSP)
TSPGA_src
- 一个运用改良的遗传算法来解决旅行商问题的程序-an improved use of genetic algorithms to solve the traveling salesman problem procedures
Genetic_Ant_Algorithms
- 一种运用蚂蚁算法和遗传算法解决旅行商问题的混合优化程序-an ant algorithm and the use of genetic algorithms to solve the traveling salesman problem hybrid optimization procedures
for TSP(Matlab)
- 模拟退火算法用于求解旅行商问题的matlab源程序-simulated annealing algorithm for solving the traveling salesman problem Matlab source
分支与界法
- 图论中使用分支与界法求解旅行商问题,直接在vc中编译可运行-graph theory with the use of branch and bound for traveling salesman problem, which directly vc compiler can run
遗传算法实现旅行商问题
- 本算法中采取了种群规模为100,同时采用轮盘赌来获取种群。开始使用随机的方法得到初始的种群-the algorithm adopted a population size of 100, using roulette to access populations. Using the stochastic method initial Stocks
TSPGA
- 用C#编的用遗传算法求解旅行商(TSP)问题的源代码。-with C# Part of the Genetic Algorithm for TSP (TSP) of the source code.
旅行商问题的动态规划算法
- bp算法的程序实现,可以任意只指定中间结点和输入输出节点的个数-bp algorithm program can only arbitrarily designated intermediate nodes and the input and output nodes Number
mazh
- 旅行商问题的算法,采用分枝限界。网上都只有算法描述,没有实现,这里给出了完整实现,并封装成1个类。-TSP algorithm used Branch and Bound. Only online algorithm descr iption, failed to materialize here is the realization of complete, and packaged as a category.
travelingsalesman
- 用动态规划法求解旅行商问题 已经加入注释 欢迎批评指正-dynamic programming method for the traveling salesman problem has joined Notes welcome criticism correction
HolyMoley
- 本软件主要用于帮助计算机爱好者学习蚁群算法时做有关蚁群算法的试验。蚁群算法作为一种优秀的新兴的算法,具有非常广的应用前景,越来越多的人开始学习蚁群算法,因此本软件也有推广前景。 本软件除了用于教学目的外,还可用于解决实际生活中的与TSP(即,旅行商问题)问题相关的问题。 TSP问题描述的是一个旅行商要到几个城市去,每个城市必须去一次且仅能去一次,要求满足这样条件的 最短路径。将本软件稍作扩展即可用于城市规划、公交车路径安排
Genetic Algorithms and the Traveling Salesman Prob
- 遗传算法的一个例子:旅行商问题。C++源代码,适合初学者研究遗传算法与最优化等方面的知识。-a genetic algorithm examples : the traveling salesman problem. C source code, suitable for beginners and genetic algorithm optimization and other kinds of knowledge.
20058702518155
- 经典的用遗传算法解决TSP问题,TsP问题就是旅行商问题。-classic genetic algorithm to solve TSP, underwent problem is the traveling salesman problem.
tetretesa
- 本程序是对经典的旅行商问题的一种解法,是学习数据结构算法的极佳材料,c语言编写-the procedures of the classic traveling salesman problem a solution is learning algorithm data structure of excellent material, language c
分支限界算法求解TSP问题
- 本程序用分支界限方法解决TSP问题,即旅行商问题.-the procedures used branch line solution to TSP, the traveling salesman problem.
近邻算法求解TSP问题
- 本程序用另外一种算法即近邻算法解决TSP,即旅行商问题,请高手指教.-this procedure with the other algorithms that solve the TSP neighbor algorithm, the traveling salesman problem, experts advise.
模拟退火
- 本程序用模拟退火算法实现了旅行商问题(tsp问题)-the procedures used simulated annealing algorithm to achieve the traveling salesman problem (tsp)
tsp(2)
- 本程序实现了多城市的tsp问题(即旅行商问题)的遗传算法-the process of multi-city tsp (ie, the traveling salesman problem) Genetic Algorithm
hopfield解决TSP问题
- 人工神经网络实验之一,用Hopfield网络解决旅行商问题。文件中除源程序外还有word文档对算法,理论,问题描述,实验结果,实验分析的完整介绍-experimental artificial neural network, Hopfield network Traveling Salesman Problem. Apart from the source document but also have a word document o