I think the reason the algorithm didn't reach an optimal route is because the regular spacing implies many distances are the same. When ties happen maybe the greedy algorithm should consider all equally good insertion points rather than only the first.I wonder why 100,000 mutations did not find an optimal route.16x16 TSP with optimal length solution 16*16*10=2560, found local minimum (100,000 mutations) is just above with 2568.
Does each book in the 144-core Lenovo server contain an Instinct MI50?
Statistics: Posted by ejolson — Fri Sep 05, 2025 11:42 pm