A,问题描述:已知100个城市的经纬度坐标如下(保存为city.txt):
53.7121 15.3046 51.1758 0.032246.3253 28.2753 30.3313 6.9348
56.5432 21.4188 10.8198 16.252922.7891 23.1045 10.1584 12.4819
20.1050 15.4562 1.9451 0.205726.4951 22.1221 31.4847 8.9640
26.2418 18.1760 44.0356 13.540128.9836 25.9879 38.4722 20.1731
28.2694 29.0011 32.1910 5.869936.4863 29.7284 0.9718 28.1477
8.9586 24.6635 16.5618 23.614310.5597 15.1178 50.2111 10.2944
8.1519 9.5325 22.1075 18.55690.1215 18.8726 48.2077 16.8889
31.9499 17.6309 0.7732 0.465647.4134 23.7783 41.8671 3.5667
43.5474 3.9061 53.3524 26.725630.8165 13.4595 27.7133 5.0706
23.9222 7.6306 51.9612 22.851112.7938 15.7307 4.9568 8.3669
21.5051 24.0909 15.2548 27.21116.2070 5.1442 49.2430 16.7044
17.1168 20.0354 34.1688 22.75719.4402 3.9200 11.5812 14.5677
52.1181 0.4088 9.5559 11.421924.4509 6.5634 26.7213 28.5667
37.5848 16.8474 35.6619 9.933324.4654 3.1644 0.7775 6.9576
14.4703 13.6368 19.8660 15.12243.1616 4.2428 18.5245 14.3598
58.6849 27.1485 39.5168 16.937156.5089 13.7090 52.5211 15.7957
38.4300 8.4648 51.8181 23.01598.9983 23.6440 50.1156 23.7816
13.7909 1.9510 34.0574 23.396023.0624 8.4319 19.9857 5.7902
40.8801 14.2978 58.8289 14.522918.6635 6.7436 52.8423 27.2880
39.9494 29.5114 47.5099 24.066410.1121 27.2662 28.7812 27.6659
8.0831 27.6705 9.1556 14.130453.7989 0.2199 33.6490 0.3980
1.3496 16.8359 49.9816 6.082819.3635 17.6622 36.9545 23.0265
15.7320 19.5697 11.5118 17.388444.0398 16.2635 39.7139 28.4203
6.9909 23.1804 38.3392 19.995024.6543 19.6057 36.9980 24.3992
4.1591 3.1853 40.1400 20.303023.9876 9.4030 41.1084 27.7149
小明当前位置经纬度坐标为h(70,40),小明欲前往这100个城市旅游。如何为小明设计一种方案使得小明从h点出发,游览完每一个城市,最后再回到h位置处后整个旅游路线最短。显然,这是一个旅行商问题(TSP),旅行商问题是一个经典的NP难问题。下面要介绍的模拟退火算法可以很好的解决类似这样的旅行商问题。
B,模拟退火算法:模拟退火算法的目标是求NP难组合优化问题的全局最优解。该方法
来源于固体退火原理,将固体加温至充分高,再让其徐徐冷却,加温时,固体内部
粒子
随
温升
变为无序状,内能增大,而徐徐冷却时粒子渐趋有序,在每个温度都达到
平衡态
,最后在
常温
时达到基态,内能减为最小。