搜索资源列表
Tsp
- 使用蚁群算法解决旅行商问题，mfc应用程序，城市数目及坐标在eil51.tsp里-use ant algorithm to solve the traveling salesman problem, and mfc applications, The number of cities and coordinates the eil51.tsp Lane
TSP_ACO
- 用蚁群算法求解TSP（旅行商）问题，按照TSP.m中要求的格式输入程序参数即可运行！-Using Ant Colony Algorithm for TSP (traveling salesman) problems, in accordance with the format requested TSP.m input process parameters to run!
TSP_PSO
- 用粒子群方法解决TSP（旅行商）问题，按照TSP1.m中的格式输入程序参数即可-Using Particle Swarm solution to TSP (traveling salesman) problems, in accordance with the format in TSP1.m parameter input program
TSP_GA
- 用遗传算法求解TSP（旅行商）问题，按照TSP1.m中的格式输入程序参数即可。-Genetic Algorithm with TSP (traveling salesman) problems, in accordance with the format in TSP1.m parameter entry process.
tspsa
- 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem)
TspGA
- 遗传算法求解旅行商问题，对４８个城市的ＴＳＰ问题进行计算，求解路径和最优路径-Genetic Algorithm for Traveling Salesman Problem, the 48 city TSP problems, the solution of the path and optimal path
TSP
- 求解旅行商问题 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？-Solving Traveling Salesman Problem is known cities n the distance between the existing of a salesman to be visited this n c
TSPDBANT
- TSP双蚁群算法，应用双蚁群算法，来解决TSP问题，即旅行商问题-TSP Two-ant colony algorithm, the application of dual-ant colony algorithm to solve TSP problems, that is, traveling salesman problem
TSP
- 这是一个用遗传算法来求解旅行商问题（TSP问题：Travelling Salesman Problem）的源代码，学习遗传算法，演化计算的很值得一看！-This is a genetic algorithm to solve the traveling salesman problem (TSP problems: Travelling Salesman Problem) source code, learning genetic al
tsp
- 遗传算法用遗传算法解决旅行商问题关键词中华人民共和国-Genetic Algorithm with Genetic Algorithm to Solve Traveling Salesman Problem Keywords People s Republic of China
tsp-ga
- 基于遗传算法解决旅行商问题的vc++源码。-Based on genetic algorithm to solve the traveling salesman problem vc++ Source.
TSP_22222
- 旅行商问题_数组实现 请设计出一个动态规划算法 程序设计 任给一个输入实例，能输出最短路程及其路线 能用图形演示旅行商的推销路线-Traveling Salesman Problem _ array to achieve, please design a dynamic programming algorithm to a program design any input example, can output th
TspSA
- 模拟退火优化旅行商问题,付城市坐标!vC++代码!-Simulated annealing optimization of traveling salesman problem, to pay the city coordinates! VC++ Code!
TSP
- 本程序利用动态规划的思想实现了经典的旅行商问题，程序中考虑为5个城市的情况。-This procedure using the idea of dynamic programming to achieve the classic traveling salesman problem, procedures to consider for the five cities.
TSP
- 用遗传算法解决旅行商问题，并用图形界面显示出来。比较了分别采用轮盘赌选择算子和锦标赛选择算子的遗传算法求解TSP问题的性能，包括：运行时间、进化总代数和最优解质量。 结果曲线可以用图形显示出来。-Genetic algorithm is used to solve the traveling salesman problem, and use graphical interface is displayed. Compared usin
dp
- (1).问题描述：旅行商问题 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要 选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（ 或旅费）最小。 (2).程序设计要求： a. 设计一个动态规划算法 b. 任给一个输入实例，能输出最短路程及其路线 c. 能用图形演示旅行商的推销路线 输入要测试的文件名，如TSP6.txt,程序将利用动
tsp
- C语言实现的遗传算法解TSP问题（旅行商问题），简单易懂。-C Language Implementation of Genetic Algorithm for TSP problem (TSP), easy-to-read.
huishufa
- 用分支限界法求界旅行商问题，用Ｃ＋＋语言编程实现-Using branch and bound method profession traveling salesman problem, using C Language Programming
TAPOFMATLAB
- 这个是最基本的使用MATLAB平台,来解决旅行商的问题,可以较好的运用matlanb来解决类似TSP的问题-This is the most basic platform for the use of MATLAB to solve the traveling salesman problems, they can better use matlanb similar to TSP to solve the problem of
ga
- 此源代码是用遗传算法解决旅行商问题的经典实例，很有借鉴意义-This source code is a genetic algorithm to solve the classic traveling salesman problem instances of referential significance to