搜索资源列表
Double_ACO_TSP
- 此程序包是用双种群蚁群算法来求中国75个城市的最短路径问题，即典型的TSP问题，把包解压运行main.m文件即可
yiqunsuanfa
- 在matlab环境下用人工智能算法--蚁群算法求TSP问题的matlab程序-In the matlab environment using artificial intelligence algorithm- ant colony algorithm for TSP problem matlab program
gsd
- 蚁群算法源程序：求31个城市的最短路径的程序！（TSP）-Ant Colony source: 31 cities seeking the shortest path program! (TSP)
aco
- 利用蚁群算法求解tsp（旅行商）问题，给出遍历方案，最后求出最短路径。-Ant colony algorithm for tsp (TSP) problem, given traversal solutions, and finally find the shortest path.
TSP
- 总结的混合粒子群算法、蚁群算法、遗传算法求TSP（旅行商问题）,值得看一看-Summary hybrid particle swarm optimization, ant colony algorithm, genetic algorithm for TSP (traveling salesman problem), it is worth a look
ACSmatlabCode
- 蚁群算法解求TSP的问题，使用Matlab语言进行编写-ACO for TSP seeking problems, written using Matlab language
ACO---pso-MTSP-
- 基于蚁群—粒子群的TSP求解，可以解决蚁群算法陷入局部最优解的问题，更好求出TSP问题-Based on ACO- pso MTSP solving the problem can be solved ant colony algorithm into local optimal solution, obtaining better TSP problem
TSP-solved-by-ACO
- 求TSP最短路径问题，采用蚁群算法求解，给予C++编程的资料和程序-TSP solved by ACO
蚁群算法TSP问题
- 典型的matlab求运行商问题，可以看到进化曲线和线路计算过程。(The typical matlab asks the operator problem, and you can see the evolution curve and the line calculation process.)
ACATSP
- 旅行商问题(Traveling Saleman Problem，TSP)是车辆路径调度问题(VRP)的特例，由于数学家已证明TSP问题是NP难题，因此，VRP也属于NP难题。旅行商问题（TSP）又译为旅行推销员问题、货郎担问题，简称为TSP问题，是最基本的路线问题，该问题是在寻求单一旅行者由起点出发，通过所有给定的需求点之后，最后再回到原点的最小路径成本(Traveling salesman Problem ('ll Saleman Problem, TSP) is a special case
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