Tue May 20 22:43:33 2025 tsp_descent_test(): python version: 3.10.12 numpy version: 1.26.4 Test tsp_descent(). tsp_descent(): Solve a small traveling salesperson problem (TSP) using a descent method, generating reversals and transpositions of a random starting tour. The city-to-city distance matrix D: [[0. 3. 4. 2. 9.] [3. 0. 4. 6. 3.] [4. 4. 0. 5. 8.] [2. 6. 5. 0. 6.] [9. 3. 8. 6. 0.]] Reversal 2: cost = 21 Number of variations tried was 2000 The best itinerary found: Step From To Distance 1 2 3 5 2 3 0 2 3 0 1 3 4 1 4 3 0 4 2 8 ---- -- -- -------------- cost: 21 tsp_descent(): Solve a small traveling salesperson problem (TSP) using a descent method, generating reversals and transpositions of a random starting tour. The city-to-city distance matrix D: [[ 0. 29. 82. 46. 68. 52. 72. 42. 51. 55. 29. 74. 23. 72. 46.] [29. 0. 55. 46. 42. 43. 43. 23. 23. 31. 41. 51. 11. 52. 21.] [82. 55. 0. 68. 46. 55. 23. 43. 41. 29. 79. 21. 64. 31. 51.] [46. 46. 68. 0. 82. 15. 72. 31. 62. 42. 21. 51. 51. 43. 64.] [68. 42. 46. 82. 0. 74. 23. 52. 21. 46. 82. 58. 46. 65. 23.] [52. 43. 55. 15. 74. 0. 61. 23. 55. 31. 33. 37. 51. 29. 59.] [72. 43. 23. 72. 23. 61. 0. 42. 23. 31. 77. 37. 51. 46. 33.] [42. 23. 43. 31. 52. 23. 42. 0. 33. 15. 37. 33. 33. 31. 37.] [51. 23. 41. 62. 21. 55. 23. 33. 0. 29. 62. 46. 29. 51. 11.] [55. 31. 29. 42. 46. 31. 31. 15. 29. 0. 51. 21. 41. 23. 37.] [29. 41. 79. 21. 82. 33. 77. 37. 62. 51. 0. 65. 42. 59. 61.] [74. 51. 21. 51. 58. 37. 37. 33. 46. 21. 65. 0. 61. 11. 55.] [23. 11. 64. 51. 46. 51. 51. 33. 29. 41. 42. 61. 0. 62. 23.] [72. 52. 31. 43. 65. 29. 46. 31. 51. 23. 59. 11. 62. 0. 59.] [46. 21. 51. 64. 23. 59. 33. 37. 11. 37. 61. 55. 23. 59. 0.]] Transpose 2: cost = 561 Reversal 2: cost = 547 Transpose 3: cost = 499 Reversal 5: cost = 497 Transpose 6: cost = 483 Reversal 6: cost = 456 Reversal 8: cost = 417 Reversal 9: cost = 413 Transpose 11: cost = 406 Reversal 15: cost = 401 Reversal 43: cost = 381 Reversal 44: cost = 373 Reversal 47: cost = 365 Reversal 59: cost = 343 Transpose 60: cost = 339 Transpose 65: cost = 335 Reversal 67: cost = 307 Transpose 109: cost = 291 Number of variations tried was 2000 The best itinerary found: Step From To Distance 1 1 14 21 2 14 8 11 3 8 4 21 4 4 6 23 5 6 2 23 6 2 11 21 7 11 13 11 8 13 9 23 9 9 7 15 10 7 5 23 11 5 3 15 12 3 10 21 13 10 0 29 14 0 12 23 0 12 1 11 ---- -- -- -------------- cost: 291 tsp_descent(): Solve a small traveling salesperson problem (TSP) using a descent method, generating reversals and transpositions of a random starting tour. The city-to-city distance matrix D: [[ 0. 633. 257. 91. 412. 150. 80. 134. 259. 505. 353. 324. 70. 211. 268. 246. 121.] [633. 0. 390. 661. 227. 488. 572. 530. 555. 289. 282. 638. 567. 466. 420. 745. 518.] [257. 390. 0. 228. 169. 112. 196. 154. 372. 262. 110. 437. 191. 74. 53. 472. 142.] [ 91. 661. 228. 0. 383. 120. 77. 105. 175. 476. 324. 240. 27. 182. 239. 237. 84.] [412. 227. 169. 383. 0. 267. 351. 309. 338. 196. 61. 421. 346. 243. 199. 528. 297.] [150. 488. 112. 120. 267. 0. 63. 34. 264. 360. 208. 329. 83. 105. 123. 364. 35.] [ 80. 572. 196. 77. 351. 63. 0. 29. 232. 444. 292. 297. 47. 150. 207. 332. 29.] [134. 530. 154. 105. 309. 34. 29. 0. 249. 402. 250. 314. 68. 108. 165. 349. 36.] [259. 555. 372. 175. 338. 264. 232. 249. 0. 495. 352. 95. 189. 326. 383. 202. 236.] [505. 289. 262. 476. 196. 360. 444. 402. 495. 0. 154. 578. 439. 336. 240. 685. 390.] [353. 282. 110. 324. 61. 208. 292. 250. 352. 154. 0. 435. 287. 184. 140. 542. 238.] [324. 638. 437. 240. 421. 329. 297. 314. 95. 578. 435. 0. 254. 391. 448. 157. 301.] [ 70. 567. 191. 27. 346. 83. 47. 68. 189. 439. 287. 254. 0. 145. 202. 289. 55.] [211. 466. 74. 182. 243. 105. 150. 108. 326. 336. 184. 391. 145. 0. 57. 426. 96.] [268. 420. 53. 239. 199. 123. 207. 165. 383. 240. 140. 448. 202. 57. 0. 483. 153.] [246. 745. 472. 237. 528. 364. 332. 349. 202. 685. 542. 157. 289. 426. 483. 0. 336.] [121. 518. 142. 84. 297. 35. 29. 36. 236. 390. 238. 301. 55. 96. 153. 336. 0.]] Transpose 1: cost = 3967 Transpose 2: cost = 3913 Transpose 6: cost = 3713 Reversal 6: cost = 3600 Reversal 8: cost = 3314 Transpose 9: cost = 3225 Reversal 10: cost = 3218 Reversal 12: cost = 3217 Transpose 19: cost = 3088 Transpose 23: cost = 3057 Reversal 23: cost = 2892 Reversal 27: cost = 2854 Transpose 29: cost = 2822 Transpose 54: cost = 2618 Transpose 124: cost = 2554 Reversal 141: cost = 2395 Reversal 144: cost = 2393 Transpose 155: cost = 2367 Reversal 155: cost = 2334 Transpose 164: cost = 2262 Reversal 175: cost = 2155 Reversal 231: cost = 2142 Reversal 342: cost = 2090 Number of variations tried was 2000 The best itinerary found: Step From To Distance 1 0 6 80 2 6 7 29 3 7 5 34 4 5 2 112 5 2 10 110 6 10 4 61 7 4 1 227 8 1 9 289 9 9 14 240 10 14 13 57 11 13 16 96 12 16 12 55 13 12 3 27 14 3 8 175 15 8 11 95 16 11 15 157 0 15 0 246 ---- -- -- -------------- cost: 2090 tsp_descent(): Solve a small traveling salesperson problem (TSP) using a descent method, generating reversals and transpositions of a random starting tour. The city-to-city distance matrix D: [[ 0. 4727. 1205. ... 1542. 2379. 3744.] [4727. 0. 3588. ... 5461. 4390. 2088.] [1205. 3588. 0. ... 2023. 1867. 2560.] ... [1542. 5461. 2023. ... 0. 1644. 3928.] [2379. 4390. 1867. ... 1644. 0. 2532.] [3744. 2088. 2560. ... 3928. 2532. 0.]] Transpose 2: cost = 162221 Reversal 3: cost = 161962 Transpose 4: cost = 161438 Transpose 5: cost = 160937 Reversal 5: cost = 150243 Transpose 6: cost = 146860 Reversal 7: cost = 146397 Reversal 8: cost = 146353 Reversal 9: cost = 143632 Transpose 10: cost = 139815 Transpose 13: cost = 138914 Reversal 15: cost = 138634 Reversal 16: cost = 137254 Transpose 18: cost = 134453 Transpose 19: cost = 130434 Reversal 19: cost = 128484 Transpose 20: cost = 128298 Reversal 21: cost = 127245 Reversal 22: cost = 126843 Reversal 23: cost = 126789 Reversal 24: cost = 126671 Transpose 25: cost = 123188 Reversal 26: cost = 119216 Reversal 27: cost = 116951 Transpose 28: cost = 109672 Reversal 28: cost = 107924 Reversal 31: cost = 107918 Reversal 33: cost = 107813 Reversal 35: cost = 107723 Transpose 36: cost = 106859 Transpose 37: cost = 106724 Transpose 40: cost = 105334 Transpose 42: cost = 104410 Reversal 42: cost = 104129 Reversal 45: cost = 100309 Reversal 48: cost = 99272 Transpose 51: cost = 97986 Reversal 52: cost = 96959 Transpose 53: cost = 96951 Reversal 53: cost = 96222 Reversal 56: cost = 95378 Transpose 60: cost = 95369 Reversal 65: cost = 93243 Transpose 67: cost = 91252 Transpose 70: cost = 90723 Transpose 74: cost = 87080 Reversal 74: cost = 86603 Transpose 78: cost = 86519 Reversal 80: cost = 86125 Reversal 92: cost = 84489 Reversal 94: cost = 84474 Reversal 96: cost = 84285 Reversal 101: cost = 84136 Reversal 104: cost = 84105 Reversal 117: cost = 83356 Transpose 118: cost = 83167 Reversal 120: cost = 82336 Reversal 124: cost = 80672 Reversal 127: cost = 79971 Transpose 128: cost = 79494 Reversal 128: cost = 79240 Reversal 129: cost = 79208 Transpose 133: cost = 78977 Reversal 133: cost = 78933 Transpose 134: cost = 78350 Reversal 136: cost = 75571 Reversal 137: cost = 75457 Reversal 140: cost = 75423 Reversal 147: cost = 74688 Transpose 149: cost = 74647 Reversal 153: cost = 74240 Transpose 157: cost = 73340 Reversal 160: cost = 73079 Transpose 167: cost = 72738 Transpose 172: cost = 72309 Reversal 174: cost = 72144 Transpose 176: cost = 71646 Reversal 189: cost = 71373 Reversal 192: cost = 71186 Transpose 195: cost = 69833 Reversal 198: cost = 67772 Transpose 213: cost = 67210 Reversal 213: cost = 66616 Reversal 215: cost = 66345 Reversal 216: cost = 65559 Transpose 225: cost = 63784 Reversal 228: cost = 60136 Transpose 239: cost = 60032 Reversal 241: cost = 60026 Transpose 243: cost = 59088 Reversal 250: cost = 58956 Transpose 260: cost = 58769 Reversal 264: cost = 58538 Reversal 265: cost = 58088 Reversal 268: cost = 57620 Transpose 271: cost = 57014 Reversal 275: cost = 55555 Transpose 281: cost = 54104 Transpose 283: cost = 53569 Reversal 286: cost = 53265 Reversal 288: cost = 53212 Reversal 305: cost = 52982 Reversal 308: cost = 52098 Reversal 319: cost = 51992 Transpose 331: cost = 51838 Transpose 341: cost = 51773 Reversal 344: cost = 50541 Reversal 368: cost = 50165 Reversal 373: cost = 49024 Reversal 419: cost = 48996 Reversal 429: cost = 48102 Reversal 440: cost = 47509 Reversal 495: cost = 47165 Transpose 507: cost = 46811 Reversal 511: cost = 46466 Transpose 549: cost = 46324 Reversal 555: cost = 46312 Transpose 573: cost = 46285 Transpose 610: cost = 46141 Reversal 631: cost = 45888 Reversal 645: cost = 45122 Reversal 726: cost = 44663 Reversal 764: cost = 43539 Reversal 792: cost = 43438 Transpose 810: cost = 43371 Reversal 858: cost = 43166 Transpose 885: cost = 43028 Reversal 926: cost = 42824 Transpose 961: cost = 42763 Reversal 979: cost = 42722 Number of variations tried was 2000 The best itinerary found: Step From To Distance 1 1 40 2756 2 40 24 2285 3 24 47 1340 4 47 4 304 5 4 41 1169 6 41 9 937 7 9 34 1102 8 34 3 1427 9 3 25 320 10 25 44 1798 11 44 23 1629 12 23 31 1687 13 31 38 533 14 38 20 1136 15 20 19 1430 16 19 46 777 17 46 10 711 18 10 12 766 19 12 13 646 20 13 22 606 21 22 2 828 22 2 21 652 23 21 30 2224 24 30 43 440 25 43 17 355 26 17 6 168 27 6 35 332 28 35 27 356 29 27 5 482 30 5 36 207 31 36 18 132 32 18 16 477 33 16 26 370 34 26 42 287 35 42 29 400 36 29 45 1609 37 45 32 422 38 32 11 531 39 11 14 406 40 14 39 554 41 39 8 676 42 8 37 611 43 37 7 985 44 7 0 563 45 0 15 1004 46 15 33 1590 47 33 28 1498 0 28 1 1204 ---- -- -- -------------- cost: 42722 tsp_descent_test(): Normal end of execution. Tue May 20 22:43:33 2025