搜索资源列表
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
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
- 用分支限界法求界旅行商问题,用C++语言编程实现-Using branch and bound method profession traveling salesman problem, using C Language Programming
ga
- 此源代码是用遗传算法解决旅行商问题的经典实例,很有借鉴意义-This source code is a genetic algorithm to solve the classic traveling salesman problem instances of referential significance to
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
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
acatsp
- 利用蚂蚁算法思想,求解旅行商问题!思路清晰,有注解,适合初学者学习!-Thinking of the use of ant algorithm to solve traveling salesman problem! Clear lines of thought, have comments, suitable for beginners to learn!
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