h1. Solving TSPLIB Instances
The file _tspSolver/src/main/Main.java_ contains code that will run your solver on instances from the [TSPLIB database|http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/]. The main method of this class begins with
{code}
public static void main(String[] args) {
String[] problemNames = new String[]{"bier127","eil51","brd14051","ch130","ch150","d198", "d493","d657", "d1291","fl1400"};
String problemName = problemNames[1];
//...
{code}
Here the elements of {{problemNames}} are files in the directory _sampleData/TSPLIB/_ that existing code will parse for you into a problem instance. The number in the file name refers to the number of cities in the problem. You can adjust which problem is attempted by assigning a different value to {{problemName}} (by changing the index used to access {{problemNames}}, or if you prefer, typing in a file name manually). Try running your solver on a few different instances (start with smaller ones).
{chart:type=bar|title=Run time for TSPLIB instances solved with lazy constraints}
||Problem Name||eil51|bier127|ch130|ch150|d198|d493|
| |0.11|0.77|1.98|5.09|17.57|600|
{chart}
Performance degrades pretty quickly on larger problems, d493 took about 600 seconds to solve!
h1. Interpreting CPLEX Output
|