SIMULATED-ANNEALING-
所属分类：matlab编程
开发工具：matlab
文件大小：490KB
下载次数：5
上传日期：2013-12-15 03:26:30
上 传 者：
无可姝儿
说明： 这是一个关于商人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.)
文件列表:
SA_TSP\data_file.m (385, 2005-09-08)
SA_TSP\distance.m (546, 2005-09-07)
SA_TSP\loadatt48.m (951, 2006-01-17)
SA_TSP\loadbays29.m (4581, 2006-01-17)
SA_TSP\loadeil101.m (1299, 2006-01-17)
SA_TSP\loadeil535.m (10242, 2006-01-12)
SA_TSP\loadgr96.m (1962, 2006-01-17)
SA_TSP\loadpcb442.m (13047, 2005-09-08)
SA_TSP\loadpr76.m (1409, 2006-01-17)
SA_TSP\loadst70.m (965, 2006-01-17)
SA_TSP\plotcities.m (1174, 2006-01-12)
SA_TSP\simulatedannealing.m (3670, 2006-02-20)
SA_TSP\Simulated_Annealing_Support_Document.pdf (526368, 2006-01-13)
SA_TSP\stsp.fig (40136, 2006-02-18)
SA_TSP\stsp.m (10670, 2006-01-17)
SA_TSP\stsp_v61.fig (39296, 2006-02-18)
SA_TSP\stsp_v61.m (10758, 2006-02-18)
SA_TSP\stsp_v61_export.m (33252, 2006-03-22)
SA_TSP\swapcities.m (472, 2005-09-15)
SA_TSP (0, 2006-03-22)
近期下载者：
相关文件：
收藏者：