Advanced Search

Question: Approximate solution of Traveling Salesman Problem

Question:Approximate solution of Traveling Salesman Problem

Russell May 15 Maple
algorithm graphtheory travelling-salesman-problem
March 15 2016
2

I am looking for a quick implementation in Maple to approximate a solution to the travelling salesman problem in a graph of several thousand vertices randomly placed in the unit square. I've tried TravelingSaleman in the GraphTheory package; it bogs down with just a handful (say, twelve) of vertices. I also tried Bruno Buerrier's implementation of the two-opt algorithm; on my machine that took more than a day for 2048 vertices. 

Is anyone aware of a quicker implementation in Maple?
Please Wait...