Traveling salesman example with known global optimum
I made a memetic algorithm in Python for traveling salesman problem . However, all the test data (list of distances between cities) I've encountered lack the information of the best solution, so I can't know how close to global optimum my algorithm gets. Does anyone know where I can find some tsp test data (preferably in matrix form, but anything's good) with known best solution? Did you google? http://www.tsp.gatech.edu/data/index.html That page provides several test-cases of which 16 has an optimal solution. Perhaps you can generate your own test data? This definitely won't be comprehensive