搜索资源列表
一些解决TSP问题的算法及源代码模拟退火算法
- 一些模拟退火算法及元代码,可以用于解决TSP问题的等，我已经验证过了 可以的，速度比较快，大家可以下载试试！ -some simulated annealing yuan and the code can be used to solve problems such as TSP, I can be tested, and faster speed, you can download a try!
遗传算法解TSP
- 实现用固定变异概率和自适应变异概率解tsp问题的比较，自适应式算法采用基于种群差异度的自适应算法，详见实验报告-achieve fixed mutation probability and Adaptive Solutions tsp mutation probability of comparison, Adaptive Algorithm-based differences in the populations adaptive algorithm, as detailed experime
TSP(TravelingSalesmanProblem)
- Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and th
tsp+vrp.rar
- 详细讲述模拟退火算法的理论原理。并TSP问题为例进行讲解，并各处多种语言的源代码，包括c，matlab以及delphi。 ,Simulated annealing algorithm described in detail the theory of principle. And TSP as an example to explain the problem and the source code of various languages, including c, matlab, as w
ACOTSP.V1.0.rar
- 解旅行商问题的ACO算法，包括了AS，EAS，ASRANK，MMAS，ACS,ACO to slove TSP. Including AS，EAS，ASRANK，MMAS，ACS.
AS-matlab-TSP
- 用蚁群算法求解典型的旅行商问题，在matlab中编程实现-based on the tyipical TSP ，use matlab to make programme，and use Ant colony algorithm
TSP.rar
- 经典的人工智能问题求解，附有遗传算法和模拟退火算法，以及调试过程,Classical artificial intelligence problem solving, with a genetic algorithm and simulated annealing algorithm, as well as the debugging process
GA_TSP
- 利用遗传算法求解TSP问题。TSP问题描述如下：给定一组n个城市和他们两两之间地直达距离，寻找一条闭合的旅程，使得每个城市刚好经过一次而且总的旅行距离最短。 -The use of genetic algorithm to solve TSP problem. TSP problem described as follows: given a set of n cities and they are between 22 to direct the distance of the journey
standard-PSO
- 标准的pso 程序，可用于tsp 等优化问题，大家分享交流 共同进步。-Standard PSO procedure, can be used for optimization problems, such as tsp, we shared the common progress.
TSP_ga
- TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序-TSP problem (also known as: traveling salesman problem, traveling salesman problem) genetic algorithm matlab common procedures
TSP
- 遗传算法实现TSP算法，包括选择、交叉等操作-TSP algorithm for genetic algorithm implementation, including selection, crossover, such as operation
tsp--yichuangsuanfa
- 程序对48个城市的TSP问题（城市坐标文件对应于48.txt）进行计算，求解路径和最优路径图如下。 48个城市结果，大的红*表示路径开始城市，途经城市依次用蓝色方块和红色*标示。 -Procedures of the 48 cities TSP problem (document coordinates corresponding to the city 48.txt) to calculate the optimal solution of the path and road map
AntTSP
- TSP问题关于蚁群最优化算法的MATLAB程序-Ant colony optimization about TSP algorithm of MATLAB
TSP
- 回溯法解决TSP问题，对于任何的无向图，只要存在回路均可找到，无回路也可检测出来！-Backtracking to solve TSP problem, for any undirected graph, loop as long as there can be found, no loop can be detected!
TSP
- 旅行商问题（Traveling Saleman Problem，TSP）又译为旅行推销员问题、货郎担问题，简称为TSP问题，是最基本的路线问题，该问题是在寻求单一旅行者由起点出发，通过所有给定的需求点之后，最后再回到原点的最小路径成本。采用回溯法，邻点法实现，有图形界面。-TSP (Traveling Saleman Problem, TSP) also translated as traveling salesman problem, traveling salesman problem, r
tsp
- 实践证明，遗传算法对于解决TSP问题等组合优化问题具有较好的寻优性能。-Practice has proved that a combination of genetic algorithms for solving optimization problems such as TSP problem has better optimization performance.
TSP问题代码
- 本文是以旅行商问题为研究点，利用蚂蚁算法优化求解最短路径，平台工具是具有绘图功能的matlab软件。(This paper takes traveling salesman problem as the research point, and uses ant algorithm to optimize the shortest path. The platform tool is matlab software with drawing function.)
基于遗传算法的 TSP 算法
- tsp问题（全称：TravellingSalesmanProblem），又称为旅行商问题、货郎担问题、TSP问题，是一个多局部最优的最优化问题，遗传算法是一种基于种群演变一种优化的算法，在此基础上的优化程序会自动寻找出最短路(TSP (full name: TravellingSalesmanProblem), also known as the traveling salesman problem, traveling salesman problem, but TSP problem is
TSP(旅行商问题)
- cost存放了一个强连通图的边权矩阵，作为一个实例。 可在workspace中加载 运用此算法要注意多次试验。(Cost holds the edge weight matrix of a strongly connected graph as an instance. You can load in workspace, use this algorithm to pay attention to many tests.)
AntColonyOptimization-TSP
- 蚁群算法作为新发展的一种模拟蚂蚁群体智能行为的仿生优化算法，它具有较强的鲁棒性、优良的分布式计算机制、易于与其他方法相结合等优点，本算法用来解决最短路径问题，并在TSP旅行商问题上取得较好的成效。同时也可以在他领域如图着色问题、车辆调度问题、集成电路设计、通讯网络、数据聚类进行参考。(Ant colony algorithm is a newly developed bionic optimization algorithm that simulates the ant colony intel