MMU_RandomEuclideanInstances.zip
Huw Lloyd, Martyn Amos · Figshare · 2017
A library of 40,000 random Euclidean travelling salesman problem instances (10,000 each of 100, 200, 500 and 1000 vertices), all solved to optimality using Concorde. Optimum values and optimum tours included.