搜索资源列表
SimulatedAnnealing(TSP)CSHARP
- 运用c＃语言实现模拟退火算法，同时利用该算法解决旅行商（TSP）问题，获得遍历所有城市序号的最优路径。-use c # language simulated annealing, while using the algorithm to solve traveling salesman (TSP). access to the serial numbers of all the cities traverse the optimal p
iACSkroc100bingxingxiaochuangkoubianyi
- 这是在最初的蚁群算法的变异算子的基础上改进的变异算子，旅行商问题中含100个城市的程序-This is the first ant colony algorithm mutation operator on the basis of improving the mutation operator, Traveling Salesman Problem with 100 cities in the process
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
huolangdan
- 问题：货郎担问题 实现方法：枚举，回溯，动态规划，分支界限法 -: traveling salesman problem Method : Enumeration, backtracking, dynamic programming, branch and bound
ElasticNet
- 使用到的参数跟谈到弹性网络的那一章里头所讲的是一样的， ke 则是终止条件。如果 step 被打勾，则程式在每一步之间会暂停 100毫秒（或其他使用者输入的数值）。如果 Random 被打勾，则程式会以系统时间作为乱数产生器的种子数，否则，就以使用者输入的数（ Random 右边那一格）为种子数。 你可以利用 load 来载入推销员问题档与其最佳解，如此便可比较弹性网络所找出来的解与最佳解差了多少。 Central,
tsp
- 是一个模拟退火程序,解决的是货郎担问题,所用的语言是matlab -is a simulated annealing procedures to solve the traveling salesman problem is that the language used is Matlab
2003011514-TSP
- 旅行商问题问题的二叉树求解方法，基于命令行参数的，-Traveling Salesman Problem Solving the problem of binary tree method, based on the command line parameters,
PSO-ACO-TSP
- PSO-ACO-TSP算法，解决旅行商问题，结合PSO和ACO算法-PSO - ACO - TSP algorithm to solve the traveling salesman problem, and with PSO and ACO Algorithm
TravelingSalesmanProblemwithGeneticAlgorithm
- this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
tsp(c)
- 简单模拟退火算法-货郎担问题.txt（c语言）-simple simulated annealing-traveling salesman problem. Txt (c language)
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
TSPproblem
- 遗传算法解决TSP问题 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？-genetic algorithm known TSP n cities between the distance, must present a salesman traveled this n cities, and each cit
HopfieldExperiment
- 采用Hopfield网络解决旅行商问题，收敛速度快。-using Hopfield network to solve the traveling salesman problem, and fast convergence.
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
TSP(travel)
- 该程序是模拟退火算法应用中旅行商问题得MATLAB实现-that the procedure was simulated annealing applications traveling salesman problem in MATLAB
travelingsalemanproblem
- 主要解决旅行商问题(traveling saleman problem,简称tsp，即已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市，求解最短距离的遗传算法。-mainly to solve the traveling salesman problem (traveling saleman problem, listed tsp, known cities n betwee
satsp
- 这是一个SA求解tsp旅行商的matlab源代码，由m文件构成，可方便大家学习模拟退火算法。-This is a traveling salesman tsp SA for the Matlab source code, document constitute m, can facilitate learning simulated annealing.
vivaldi-sim-Aug232006.tar
- 题描述的是一个旅行商要到几个城市去，每个城市必须去一次且仅能去一次，要求满足这样条件的最短路径。将本软件稍作扩展即可用于城市规划、公交车路径安排-that descr iption is a traveling salesman to several cities, each city must go to one and only one, satisfy requirements for the shortest path. Thi