Symetric Travelling Salesman Problem solved by Evolutionary algorithm. Concurrent implementation with OpenMP.
g++ -std=c++11 -fopenmp -Ofast tspevo.cpp -o tspevo
Processor: Intel(R) Core(TM) i3-3220T CPU @ 2.80GHz
| nodes | Pop. | Mut. | Iter | Exec (s) | Best in | Best path length |
|---|---|---|---|---|---|---|
| 158 | 26 | 0.02 | 100 | 14.6 | 96 | 3686.23 |
| 158 | 26 | 0.02 | 300 | 52.7 | 298 | 2664.42 |
| 158 | 50 | 0.02 | 100 | 44.72 | 97 | 3499.55 |
| 158 | 10 | 0.02 | 1000 | 56.4529 | 986 | 2086.67 |
| 158 | 15 | 0.02 | 1000 | 76.524 | 927 | 1890.87 |
| 158 | 25 | 0.02 | 1000 | 165.077 | 909 | 1756.04 |
| 158 | 35 | 0.02 | 1000 | 337.089 | 950 | 1584.41 |
| 158 | 26 | 0.02 | 1000 | 152.002 | 932 | 1650.26 |
| 158 | 15 | 0.02 | 10000 | 1400.93 | 9461 | 389.71 |
- nodes - number of nodes
- Pop - Population size
- Mut - Mutation probability
- Iteration - limit of iterations
- Exec - Execution time in seconds
- Best in - In which iteration best path was reached
from http://www.math.uwaterloo.ca/tsp/vlsi/xqf131.tsp
[INFO] Iteration 1. Best path length: 4892.96
[INFO] Iteration 2. Best path length: 4815.46
[INFO] Iteration 3. Best path length: 4841.94
[INFO] Iteration 4. Best path length: 4965.04
[INFO] Iteration 5. Best path length: 4965.04
[INFO] Iteration 6. Best path length: 4841.56
[INFO] Iteration 7. Best path length: 4840.66
[INFO] Iteration 8. Best path length: 4794.66
[INFO] Iteration 9. Best path length: 4835.4
[INFO] Iteration 10. Best path length: 4815.91
[INFO] Iteration 11. Best path length: 4773.49
[INFO] Iteration 12. Best path length: 4684.57
[INFO] Iteration 13. Best path length: 4552.92
[INFO] Iteration 14. Best path length: 4743.56
[INFO] Iteration 15. Best path length: 4579.03
[INFO] Iteration 16. Best path length: 4592.07
[INFO] Iteration 17. Best path length: 4495.88
[INFO] Iteration 18. Best path length: 4487
[INFO] Iteration 19. Best path length: 4597.78
[INFO] Iteration 20. Best path length: 4427.67
[INFO] Iteration 21. Best path length: 4460.73
[INFO] Iteration 22. Best path length: 4465.67
[INFO] Iteration 23. Best path length: 4456
[INFO] Iteration 24. Best path length: 4486.95
[INFO] Iteration 25. Best path length: 4483.82
[INFO] Iteration 26. Best path length: 4271.56
[INFO] Iteration 27. Best path length: 4433.26
[INFO] Iteration 28. Best path length: 4345.01
[INFO] Iteration 29. Best path length: 4311.72
[INFO] Iteration 30. Best path length: 4349.89
[INFO] Iteration 31. Best path length: 4250.42
[INFO] Iteration 32. Best path length: 4323.68
[INFO] Iteration 33. Best path length: 4418.08
[INFO] Iteration 34. Best path length: 4198.91
[INFO] Iteration 35. Best path length: 4314.24
[INFO] Iteration 36. Best path length: 4286.59
[INFO] Iteration 37. Best path length: 4282.77
[INFO] Iteration 38. Best path length: 4297.68
[INFO] Iteration 39. Best path length: 4280.28
[INFO] Iteration 40. Best path length: 4377.39
[INFO] Iteration 41. Best path length: 4224.41
[INFO] Iteration 42. Best path length: 4201.69
[INFO] Iteration 43. Best path length: 4161.2
[INFO] Iteration 44. Best path length: 4219.18
[INFO] Iteration 45. Best path length: 4147.13
[INFO] Iteration 46. Best path length: 4264.95
[INFO] Iteration 47. Best path length: 4079.16
[INFO] Iteration 48. Best path length: 4068.77
[INFO] Iteration 49. Best path length: 4042.68
[INFO] Iteration 50. Best path length: 4049.24
[INFO] Iteration 51. Best path length: 4054.44
[INFO] Iteration 52. Best path length: 4075.8
[INFO] Iteration 53. Best path length: 3897.93
[INFO] Iteration 54. Best path length: 3908.82
[INFO] Iteration 55. Best path length: 4036.32
[INFO] Iteration 56. Best path length: 3929.47
[INFO] Iteration 57. Best path length: 3907.36
[INFO] Iteration 58. Best path length: 3922.72
[INFO] Iteration 59. Best path length: 3850.35
[INFO] Iteration 60. Best path length: 3916.54
[INFO] Iteration 61. Best path length: 3832.7
[INFO] Iteration 62. Best path length: 3922.03
[INFO] Iteration 63. Best path length: 3736.68
[INFO] Iteration 64. Best path length: 3906.43
[INFO] Iteration 65. Best path length: 3801.42
[INFO] Iteration 66. Best path length: 3856.58
[INFO] Iteration 67. Best path length: 3753.32
[INFO] Iteration 68. Best path length: 3812.63
[INFO] Iteration 69. Best path length: 3677.52
[INFO] Iteration 70. Best path length: 3781.1
[INFO] Iteration 71. Best path length: 3814.47
[INFO] Iteration 72. Best path length: 3714.8
[INFO] Iteration 73. Best path length: 3595.85
[INFO] Iteration 74. Best path length: 3743.34
[INFO] Iteration 75. Best path length: 3699.99
[INFO] Iteration 76. Best path length: 3681.16
[INFO] Iteration 77. Best path length: 3756.42
[INFO] Iteration 78. Best path length: 3766.1
[INFO] Iteration 79. Best path length: 3703
[INFO] Iteration 80. Best path length: 3696.13
[INFO] Iteration 81. Best path length: 3661.63
[INFO] Iteration 82. Best path length: 3508.97
[INFO] Iteration 83. Best path length: 3671.7
[INFO] Iteration 84. Best path length: 3600.22
[INFO] Iteration 85. Best path length: 3633.96
[INFO] Iteration 86. Best path length: 3663.24
[INFO] Iteration 87. Best path length: 3564.11
[INFO] Iteration 88. Best path length: 3661.89
[INFO] Iteration 89. Best path length: 3587.28
[INFO] Iteration 90. Best path length: 3614.12
[INFO] Iteration 91. Best path length: 3667
[INFO] Iteration 92. Best path length: 3654.42
[INFO] Iteration 93. Best path length: 3583.16
[INFO] Iteration 94. Best path length: 3558.15
[INFO] Iteration 95. Best path length: 3494.86
[INFO] Iteration 96. Best path length: 3543.74
[INFO] Iteration 97. Best path length: 3469.49
[INFO] Iteration 98. Best path length: 3482.9
[INFO] Iteration 99. Best path length: 3488.41
[INFO] Iteration 100. Best path length: 3545.34
[FINAL] Best path length: 3469.49 reached in 96 iteration.
Time spent solving 14.6619