27 July 2026 9:35:22.289 PM tsp_anneal_test(): Fortran90 version tsp_anneal() uses simulated annealing to solve the traveling salesman problem (TSP). Cost of initial random tour is 3181.26 tsp_anneal(): Temperature = 0.500000 Tour cost = 762.607372 Successful moves: 151 tsp_anneal(): Temperature = 0.450000 Tour cost = 694.590231 Successful moves: 13 tsp_anneal(): Temperature = 0.405000 Tour cost = 696.011059 Successful moves: 3 tsp_anneal(): Temperature = 0.364500 Tour cost = 692.112373 Successful moves: 3 tsp_anneal(): Temperature = 0.328050 Tour cost = 688.964955 Successful moves: 2 tsp_anneal(): Temperature = 0.295245 Tour cost = 688.964955 Successful moves: 0 The final path: City X Y 37 147.0000 36.0000 36 147.0000 18.0000 35 135.0000 32.0000 34 125.0000 30.0000 33 113.0000 13.0000 32 112.0000 24.0000 31 112.0000 37.0000 30 104.0000 35.0000 29 85.0000 25.0000 28 83.0000 38.0000 21 52.0000 41.0000 20 27.0000 33.0000 19 3.0000 42.0000 18 4.0000 66.0000 15 3.0000 97.0000 14 6.0000 106.0000 13 37.0000 94.0000 16 21.0000 82.0000 17 33.0000 67.0000 22 57.0000 59.0000 23 58.0000 66.0000 11 73.0000 79.0000 12 72.0000 91.0000 10 99.0000 83.0000 25 99.0000 67.0000 24 88.0000 65.0000 27 89.0000 55.0000 26 95.0000 55.0000 6 126.0000 53.0000 7 125.0000 60.0000 8 119.0000 68.0000 9 117.0000 74.0000 3 133.0000 73.0000 4 140.0000 70.0000 2 166.0000 88.0000 1 170.0000 85.0000 42 174.0000 87.0000 41 172.0000 82.0000 40 158.0000 61.0000 39 157.0000 54.0000 5 142.0000 55.0000 38 154.0000 45.0000 Cost of path = 688.965 Created data file "dantzig42_data.txt". Created command file "dantzig42_commands.txt". tsp_anneal_test(): Normal end of execution. 27 July 2026 9:35:22.293 PM