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:
“I am always glad to think that my education was, for the most part, informal, and had not the slightest reference to a future business career. It left me free and untrammeled to approach my business problems without the limiting influence of specific training.”
—Alice Foote MacDougall (18671945)
“Certainly, young children can begin to practice making letters and numbers and solving problems, but this should be done without workbooks. Young children need to learn initiative, autonomy, industry, and competence before they learn that answers can be right or wrong.”
—David Elkind (20th century)