Traveling salesman library using approximation algorithm

Question

I'm currently doing a project that requires some fast TSP solving (about 50-100 nodes in 2 seconds). There are a lots of approximation algorithms out there, but I don't have time nor will to analyze them and code them myself.

Are there any free libraries that can solve TSP problem (approximation will do too)? Something like sortedNodes = solveTspPrettyPlease(nodes, 2sec) would be just great.

Thanks in advance.

+1 " *Something like sortedNodes = solveTspPrettyPlease(nodes, 2sec) would be just great* " I lol'ed. :) If only everything could be solved like that. Imagine this: *pleaseRunMyEntireApplicationAsItShouldKThxBye()*. :) — SyntaxT3rr0r, Dec 28 '10 at 14:06

score 1 · Accepted Answer · answered Dec 28 '10 at 12:55

1

http://code.google.com/p/java-traveling-salesman/ - genetic algorithm solution
http://www.adaptivebox.net/CILib/code/tspcodes_link.html - links to many solutions, not all of which (if any?) are libraries

answered Dec 28 '10 at 12:55

moinudin

134,091
45
190
216

score 0 · Answer 2 · answered Jan 17 '11 at 10:52

Regarding the http://code.google.com/p/java-traveling-salesman/ link, you'll need to get the CVS version of jgap from April 1, 2006. You'll also need to hack the tsp code a little bit. Change JGapGreedyCrossoverEngine.java from protected double evaluate(Chromosome a_subject) to protected double evaluate(IChromosome a_subject)

Traveling salesman library using approximation algorithm

2 Answers2