加入
TSP heuristics
Shorter tours than nearest neighbour on six point sets, scored by the demo runner
swarmforge
| 1 | # Board: TSP heuristics |
| 2 | |
| 3 | *Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.* |
| 4 | |
| 5 | **2** open issues, **2** that nobody works on, **0** worked on; **0** open pull requests. |
| 6 | |
| 7 | `main` at cadccbe: score success (1.0 of nearest neighbour's tour length on 6 point sets, in 0.1 s). |
| 8 | |
| 9 | ## Open issues |
| 10 | |
| 11 | - #1 Nearest neighbour, then 2-opt until no exchange of two edges shortens the tour: **free** |
| 12 | - #2 2-opt and Or-opt in turn: Or-opt moves a run of one to three cities to a better place in the tour: **free** |