搜索资源列表
旅行商问题源代码-带有图形功能
- 某售货员要到若干城市去推销商品,已知各城市之间的路程(或旅费)。他要选定一条 从驻地出发,经过每个城市一遍,最后回到驻地的路线,使总的路程(或旅费)最小。 VC 旅行商问题源代码-带有图形功能.-a salesman to a number of cities to sell commodities, the known distance between cities (or travel). He selected a departure from the resident, a
TSP(lvxingshangwenti)
- 模拟退火求解TSP旅行商问题,有全部的matlab源代码。并且有帮助文件。
tsp-ranee
- Hopfiled 实现TSP旅行商问题 CH
matlab--tsp tsp问题 旅行商问题 matlab求解
- tsp问题 旅行商问题 matlab求解 遗传算法-TSP problem traveling salesman problem with MATLAB genetic algorithm
tsp.rar
- 旅行商问题,总共30个城市,计算最优路线和最短路径,Traveling Salesman Problem, a total of 30 cities, calculating the optimal route and the shortest path
PSO-TSP
- 在分析粒子群优化的搜索原理的基础上,通过引入交换子和交换序的概念,构造 一种特殊的粒子群优化算法,并用于求解旅行商问题。 - This algorithm introduces the search strategies of particle swarm optimiza- tion (PSO),via presenting the concepts of swap operator and swap sequence an algorithm of a kind of spe
2
- tsp遗传算法代码 利用交叉算子改进方法求解旅行商问题-tsp genetic algorithm code
TSP
- 使用蚁群算法编写的C++环境下的旅行商(TSP)经典问题的解决方法-Ant colony algorithm using C++ environment, prepared under the traveling salesman (TSP) classical solution to the problem
GATSP
- 用遗传算法写的求解TSP问题 四种情况 多旅行商单出发点 多旅行商多出发点 单旅行商以点的坐标计算及以距离矩阵计算-Written by using genetic algorithms for solving TSP problems, four cases: more than a single starting point for traveling salesman, multi-traveling salesman more than a starting point, a singl
ABC解决TSP问题程序
- ABC算法解决TSP旅行商问题,使用matlab语言,适应于ABC算法的初学者(The ABC algorithm for solving TSP problem)
GA-TSP
- 利用遗传算法求解旅行商问题,求解100城市的最短路程(Using GA to solve TSP problem)
旅行商问题
- 基于遗传算法求解旅行商问题,程序中随机设置了城市点出现的情况。(Genetic algorithm based travel salesman problem, the program randomly set up the city point of view.)
基于模拟退火算法的TSP算法
- 基于模拟退火算法的TSP算法,MATLAB算例实现(MATLAB code for Travelling salesman problem, TSP ,and it is in simulate annealing algorithm)
gaTSP
- 旅行商问题,以10个、30个城市为例,文件为TSP代码。(Traveling salesman problem, take 10, 30 cities for example, the document is TSP code.)
tsp_ga
- 适用于TSP问题。旅行商问题,即TSP问题(Traveling Salesman Problem)又译为旅行推销员问题、货郎担问题,是数学领域中著名问题之一。(Apply to the TSP problem. The traveling salesman problem is one of the famous problems in the field of mathematics.)
AntColonyOptimization-TSP
- 蚁群算法作为新发展的一种模拟蚂蚁群体智能行为的仿生优化算法,它具有较强的鲁棒性、优良的分布式计算机制、易于与其他方法相结合等优点,本算法用来解决最短路径问题,并在TSP旅行商问题上取得较好的成效。同时也可以在他领域如图着色问题、车辆调度问题、集成电路设计、通讯网络、数据聚类进行参考。(Ant colony algorithm is a newly developed bionic optimization algorithm that simulates the ant colony intel
蚁群算法的优化计算——旅行商问题(TSP)优化
- 蚁群算法的优化计算——旅行商问题(TSP)优化(Optimization calculation of ant colony algorithm)
GA for TSP - Final
- 用遗传算法实现旅行商问题,可选择城市数量(Traveling salesman problem is realized by genetic algorithm, and the number of cities can be selected.)
tsp
- 遗传算法,旅行商问题的python代码(The Python code of the genetic algorithm, the traveling salesman problem)
prbgramgood
- matlab程序,遗传算法解决经典的TSP(旅行商)问题,不错的(The matlab program, the genetic algorithm to solve the classical TSP (traveling salesman problem, good)