Free Software For Solving TSP
| Name (alphabetically) |
License | API language | Brief info |
|---|---|---|---|
| Concorde | free for academic | only executable | requires a linear solver installation for its MILP subproblem |
| DynOpt | ? | C | an ANSI C implementation a dynamic programming based algorithm developed by Balas and Simonetti, approximate solution |
| LKH | research only | C | an effective implementation of the Lin-Kernighan heuristic for Euclidean traveling salesman problem |
| OpenOpt | BSD | Python | exact and approximate solvers, STSP / ATSP, can handle multigraphs, constraints, multiobjective problems, see its TSP page for details and examples |
| tspg | GPL | C++ | branch and bound algorithm |
| TSPGA | ? | C | approximate solution of the STSP using the ``pgapack" package |
Read more about this topic: Travelling Salesman Problem
Famous quotes containing the words free and/or solving:
“A free spirit must be able to surmount anxiety time after time.”
—Mason Cooley (b. 1927)
“There are horrible people who, instead of solving a problem, tangle it up and make it harder to solve for anyone who wants to deal with it. Whoever does not know how to hit the nail on the head should be asked not to hit it at all.”
—Friedrich Nietzsche (1844–1900)