The NEOS Server offers Concorde for the solution of
Traveling Salesman Problems.
Concorde was written by
Robert E. Bixby,
Vaek Chvátal, and
William J. Cook.
Source code, binaries, and documentation are available from the
This solver was implemented by
and executes at
Using the NEOS Server for Concorde
The user must submit a symmetric TSP problem in either the simple 2-d coordinate form (first line is just the number of cities!)
The user can currently choose between applying the exact algorithm and the
Lin-Kernighan heuristic (especially for large instances).
Concorde can be called with the authors'
QSopt LP solver
benchmark gives you an
impression of its performance with different LP solvers.
If Concorde terminates prematurely it may have run out of time or memory.
Either the fixed random seed 99 can be used or a variable one.
Users who submit via web submission (not email or XML-RPC) can further
choose to receive a PDF file plotting the optimal resp. final tour.
Enter the complete path to the file with the xy-list (distances measured in the Euclidean(L2) norm)
Concorde data(xy-list file, L2 norm):
Or, enter the complete path to the file with the xy-list (distances measured in the Manhattan(L1) norm)
Concorde data(xy-list file, L1 norm):
Or, enter the complete path to the symmetric TSPLIB file
Concorde data(TSPLIB format file):
Choose the algorithm (cqs=QSopt, con=CPLEX [default], lk=Lin-Kernighan)
Choose the random seed (fixed=99 [default], variable=random)
PDF file of the optimal tour? (no [default], cp=yes, pf=w/o cities)
Dry run: generate job XML instead of submitting it to NEOS
Short Priority: submit to higher priority queue with maximum CPU time of 5
Please do not click the 'Submit to NEOS' button more than once.