NEOS Interfaces to concorde

Sample Submissions
WWW Form - XML-RPC

concorde

The NEOS Server offers Concorde for the solution of symmetric Traveling Salesman Problems. Concorde was written by David Applegate, Robert E. Bixby, Vasek Chvatal, and William J. Cook.
Source code, binaries, and documentation are available from the Concorde homepage.

Using the NEOS Server for concorde/TSP


The user must submit a symmetric TSP problem in either the simple 2-d coordinate form (first line is just the number of cities!) 

              #cities
              x_0 y_0
              x_1 y_1
              .
              .
              .
              x_n-1 y_n-1
or in TSPLIB format.

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 or CPLEX. This small 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.

Web Submission Form
Concorde Data Input
Set input type



Concorde Input File
A text file containing the complete path in symmetric TSPLIB file or the xy-list in L2 or L1 format (please choose the appropriate file type above).
Algorithm
Set algorithm


Use a fixed seed of 99
Check the box to use a fixed seed of 99. The default is to use a random seed.
Additional Settings


E-Mail address:
Please do not click the 'Submit to NEOS' button more than once.
By submitting a job, you have accepted the Terms of Use