搜索资源列表
luxingshang
- 用C编的遗传算法求解旅行商问题的源码-C series of the Genetic Algorithm for the Traveling Salesman Problem source 000000000000000000
tourzxh
- 旅行商问题,动态规划,附加说明文档,是程序竞赛的经典题-traveling salesman problem, dynamic programming, additional documentation, and procedures of the classic title race
gatsp1
- matlab程序,遗传算法解决经典的TSP(旅行商)问题-Matlab procedures, genetic algorithm to solve the classic TSP salesman problem (TSP)
TSPGACCODE
- 旅行商问题的遗传算法求解源代码,多目标优化经典问题的现代启发式算法实现-traveling salesman problem genetic algorithm source code, multi-objective optimization of the modern classic Heuristic Algorithm
Discrete_PSO_TSP_C
- 离散粒子群算法(Discrete PSO)C语言源代码。 附带有利用D-PSO解决旅行商问题(TSP)的代码可作为使用时的Demo参考-discrete particle swarm algorithm (Discrete PSO) C language source code. Incidental use of a D-PSO solve the traveling salesman problem (TSP) code can
tsp-word
- 用遗传算法解决旅行商问题的简单实现.word格式,简单,易懂 -using genetic algorithms to solve the traveling salesman problem simple realization. Word format, a simple, understandable
antantant
- 基于最近比较流行的遗传算法的TSP(旅行商问题的研究-based on the recent popularity of genetic algorithm TSP (Traveling Salesman Problem Research
travelingsalemanproblem
- 主要解决旅行商问题(traveling saleman problem,简称tsp,即已知n个城市之间的相互距离,现有一个推销员必须遍访这n个城市,并且每个城市只能访问一次,最后又必须返回出发城市,求解最短距离的遗传算法。-mainly to solve the traveling salesman problem (traveling saleman problem, listed tsp, known cities n betwee
libMeridian-1.0.tar
- 件主要用于帮助计算机爱好者学习蚁群算法时做有关蚁群算法的试验。蚁群算法作为一种优秀的新兴的算法,具有非常广的应用前景,越来越多的人开始学习蚁群算法,因此本软件也有推广前景。 本软件除了用于教学目的外,还可用于解决实际生活中的与TSP(即,旅行商问题)问题相关的问题。-mainly used to help computer enthusiasts Ant learning algorithm to do the ant algorith
MAOS_TSP
- 用于求解TSP(Traveling salesman problem,旅行商问题)问题,基本执行见run.bat, 其它详见其中的readme.txt。(实例为TSPLIB格式,见myprojects目录,包括eil51, d198, lin318等小型问题,以及1000到3000城市之间的例子,基本能得到最优解)-for TSP (Traveling salesman problem, TSP), the implementation
TSP_PianYi
- 图论中的经典TSP旅行商问题的“便宜”算法,C语言实现的DOC程序。-graph theory of classical TSP Traveling Salesman Problem "bargain" algorithm, C language DOC procedures.
toolbox-tsp
- 是全面分析旅行商问题的工具箱,包含了很多方面的测试程序-is a comprehensive analysis of the traveling salesman problem toolbox contains a lot of testing procedures
travelsale
- 利用遗传算法解决旅行商问题,以五个城市为例,给出了程序的源码和具体说明。-using genetic algorithms to solve the traveling salesman problem, and to five cities as an example, the program source and specify.
TSP
- 旅行商问题: 某售货员要到若干城市去推销商品,已知各城市之间的路程(或旅费)。他要选定一条从驻地出发,经过每个城市一遍,最后回到驻地的路线,使总的路程(或旅费)最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He s
benchmark+for+DP
- 旅行商问题(动态规化) 某售货员要到若干城市去推销商品,已知各城市之间的路程(或旅费)。他要选定一条从驻地出发,经过每个城市一遍,最后回到驻地的路线,使总的路程(或旅费)最小。 例如:给定4个城市{1,2,3,4}及其各城市之间的路程 -traveling salesman problem (dynamic regulation of) a salesman to a number of cities to s
benchmark+for+DP
- 旅行商问题动态规划算法的应用 某售货员要到若干城市去推销商品,已知各城市之间的路程(或旅费)。他要选定一条从驻地出发,经过每个城市一遍,最后回到驻地的路线,使总的路程(或旅费)最小。 -TSP dynamic programming algorithm of a salesman to a number of cities to sell commodities, known the distance between ci
GA_TSA
- 利用遗传算法解决TSP旅行商问题的Java原码-using genetic algorithms to solve the traveling salesman problem TSP original Java code
SA_TSA
- 利用模拟退火算法解决旅行商问题的java原码-using simulated annealing algorithm to solve the traveling salesman problem java original code
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
TspGA
- 遗传算法求解旅行商问题,对48个城市的TSP问题进行计算,求解路径和最优路径-Genetic Algorithm for Traveling Salesman Problem, the 48 city TSP problems, the solution of the path and optimal path