Description: 经典的货郎担问题解决办法，采用了模拟退火算法，结构非常清楚，速度很快！-classic traveling salesman problem solution, using simulated annealing, the structure is very clear, very fast! Platform: |
Size: 1437696 |
Author:红红 |
Hits:
Description: 运用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 path. Platform: |
Size: 131072 |
Author:linvg |
Hits:
Description: 模拟退火求解TSP旅行商问题，有全部的matlab源代码。并且有帮助文件。-Simulated Annealing for Solving Traveling Salesman Problem TSP, has all of matlab source code. And have help files. Platform: |
Size: 8192 |
Author:张云 |
Hits:
Description: 模拟退火算法解决旅行商问题，从文件读入城市信息-Simulated annealing algorithm to solve traveling salesman problem, reading from the file information into the city Platform: |
Size: 7168 |
Author:肖佩瑶 |
Hits:
Description: 利用模拟退火算法解决旅行商问题，共二十个城市，选择最优路径-The use of simulated annealing algorithm to solve traveling salesman problem Platform: |
Size: 55296 |
Author:wujian |
Hits:
Description: 模拟退火算法的MATLAB实例，包含图作色，旅行商等多个问题的例子。-Simulated annealing algorithm of MATLAB examples, including Fig作色, traveling salesman problem, and many other examples. Platform: |
Size: 14336 |
Author:boy |
Hits:
Description: 一篇关于模拟退火算法解决TSP问题的MATLAB代码，拿来分享，欢迎讨论-On a simulated annealing algorithm to solve TSP problem of MATLAB code, used to share, please discuss Platform: |
Size: 9216 |
Author:Allen |
Hits:
Description: 使用模拟退火算法解决旅行商问题，输入为城市之间距离的描述，输出为城市之间的路径-The use of simulated annealing algorithm to solve the traveling salesman problem, enter a description of the distance between cities, the output path between cities Platform: |
Size: 6144 |
Author:lss |
Hits:
Description: 模拟退火算法 简单清晰 他是一种求解旅行商问题的高效算法，适合大家研究，欢迎改进，指正。-It is a simulated annealing algorithm.He is an efficient algorithm is used for solving the traveling salesman problem Platform: |
Size: 4096 |
Author:Wang Hao |
Hits:
Description: 这是一个关于商人visit许多城市，怎样走法才能使距离最短的例子，采样的了退火算法的经典案例-Traveling Salesman Problem (TSP) has been an interesting problem for a l
me in classical optimization techniques which are based on linear and nonlin
ogramming. TSP can be described as follows: Given a numberof cities to v
d their distances from all other cities know, an optimal travel route has to
und so that each city is visited one and only once with the least possible dista
aveled. This is a simple problem with handful of cities but becomes complica
the number increases. Platform: |
Size: 501760 |
Author:罗佳婷 |
Hits:
Description: 使用模拟退火选择路径问题，例如一个旅行商问题，给定N个城市，有一个推销员必须遍访这N个城市，而且每个城市只能访问一次最后回到出发的那个城市，要求安排合理的访问顺序，以实现访问路线最短的目标。-Select the path using the simulated annealing problems, such as a traveling salesman problem, given N cities, a salesman must have visited this N cities, and each city can only be accessed once the final return to the starting of the city, it requires reasonable arrangements the access order to achieve the shortest access route target. Platform: |
Size: 649216 |
Author:刘同学 |
Hits:
Search - salesman annealing