Location:
Search - tspsa
Search list
Description: Procedure TSPSA:
begin
init-of-T { T为初始温度}
S={1，……，n} {S为初始值}
termination=false
while termination=false
begin
for i=1 to L do
begin
generate(S′form S) { 从当前回路S产生新回路S′}
Δt:=f(S′))-f(S) {f(S)为路径总长}
IF(Δt<0) OR (EXP(-Δt/T)>Random-of-[0,1])
S=S′
IF the-halt-condition-is-TRUE THEN
termination=true
End
T_lower
End
End
Platform: |
Size: 815860 |
Author: zhou |
Hits:
Description: 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。
Platform: |
Size: 1231687 |
Author: 吴昆 |
Hits:
Description: 模拟退火智能优化算法对TSP问题的解决的源码修改！
Platform: |
Size: 3580934 |
Author: 孔亮 |
Hits:
Description: 模拟退火算法解决TspSA
Platform: |
Size: 613644 |
Author: 于亚秀 |
Hits:
Description: 模拟退火优化旅行商问题,付城市坐标!vC++代码!
Platform: |
Size: 48122 |
Author: zzz |
Hits:
Description: TSPSA by AI of
Simulated Annealing
Platform: |
Size: 19053 |
Author: liyiyang |
Hits:
Description: 使用模拟退火算法求解TSP优化问题,采用Visual C++实现的.
Platform: |
Size: 54114 |
Author: lxz |
Hits:
Description: Procedure TSPSA:
begin
init-of-T { T为初始温度}
S={1，……，n} {S为初始值}
termination=false
while termination=false
begin
for i=1 to L do
begin
generate(S′form S) { 从当前回路S产生新回路S′}
Δt:=f(S′))-f(S) {f(S)为路径总长}
IF(Δt<0) OR (EXP(-Δt/T)>Random-of-[0,1])
S=S′
IF the-halt-condition-is-TRUE THEN
termination=true
End
T_lower
End
End
-Procedure TSPSA: begin init-of-T (T as the initial temperature) S = (1, ... ..., n) (S for the initial value) termination = false while termination = false begin for i = 1 to L do begin generate (S form S) (from the current S-loop circuit to generate new S ) Δt: = f (S ))-f (S) (f (S) for the path length) IF (Δt <0) OR (EXP (-Δt/T)> Random-of-[0,1]) S = S IF the-halt-condition-is-TRUE THEN termination = true End T_lower End End
Platform: |
Size: 815104 |
Author: zhou |
Hits:
Description: 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。
-Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel business to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum.
Platform: |
Size: 1231872 |
Author: 吴昆 |
Hits:
Description: 模拟退火智能优化算法对TSP问题的解决的源码修改！-Intelligent optimization simulated annealing algorithm to solve TSP problem modify the source code!
Platform: |
Size: 9077760 |
Author: 孔亮 |
Hits:
Description: 模拟退火算法解决TspSA-Simulated annealing algorithm to solve TspSA
Platform: |
Size: 613376 |
Author: 于亚秀 |
Hits:
Description: 模拟退火优化旅行商问题,付城市坐标!vC++代码!-Simulated annealing optimization of traveling salesman problem, to pay the city coordinates! VC++ Code!
Platform: |
Size: 48128 |
Author: zzz |
Hits:
Description: TSPSA by AI of
Simulated Annealing-TSPSA by AI of Simulated Annealing
Platform: |
Size: 19456 |
Author: liyiyang |
Hits:
Description: 使用模拟退火算法求解TSP优化问题,采用Visual C++实现的.-The use of simulated annealing algorithm for solving TSP optimization problem, using Visual C++ Achievable.
Platform: |
Size: 54272 |
Author: lxz |
Hits:
Description: 用模拟退火算法求解旅行商问题的代码，采用C++编写-Using Simulated Annealing Algorithm for Solving Traveling Salesman Problem code, using C++ Prepared
Platform: |
Size: 28672 |
Author: nc21lym |
Hits:
Description: 用模拟退火算法对求解旅行商组合优化问题作了一定的研究，提出了多种不同的随机抽样方式，并对其进行了分析计算并以代码实现。
-This paper studied the optimizing of the traveling salesman problem with the Simulated Annealing(SA)．
Different random sampling forms were proposed and analyzed．
Platform: |
Size: 7827456 |
Author: 裴 |
Hits:
Description: 用matlab实现模拟退火算法,是学习模拟退火算法的有用工具-it is a good programme for annealing simulation
Platform: |
Size: 43008 |
Author: 王云 |
Hits:
Description: 针对基于遗传算法的TSP 问题求解, 尝试了多种遗传操作, 分析了这些操作在遗传算法中的作用, 讨论了基因片段保序在利用遗传算法求解TSP 问题中的重要性.-Based on Genetic Algorithm for TSP Problem Solving, try a variety of genetic manipulation, analysis of these operations at the role of genetic algorithm discussed Ordering gene fragments at the use of genetic algorithm to solve problem of the importance of TSP.
Platform: |
Size: 865280 |
Author: 月 |
Hits:
Description: 首先介绍模拟退火算法，然后编写伪程序，结合Visual C++开发工具求解著名的旅行商问题TSP-Simulated annealing algorithm first introduced, and then the preparation of pseudo-process, combined with Visual C++ development tools for solving the famous Traveling Salesman Problem TSP
Platform: |
Size: 927744 |
Author: liuzhiyong |
Hits:
Description: 该程序是模拟退火算法应用中旅行商问题的c++程序-The procedure is the application of simulated annealing algorithm for the traveling salesman problem c++ program
Platform: |
Size: 641024 |
Author: 586 |
Hits: