Skip to main content
Aug 27, 2010 9:10 AM UTC
Question

Travaling salesman problem

The salesman on the video uses the nearest neighbour algorithm (a "greedy" algorithm). See the Mathcad-sheet here (pic)

I am creating/searching more optimal open Mathcad program: anneal (as in one Mathcad extension puck), genetic, ant etc.

Do You have?

Thanks!

 

 

Unable to play video. Please try again later.
(view in My Videos)

4 replies

Aug 27, 2010 2:13 PM UTC

Wow, how long would it take a salesman to hit 976 cities?

Aug 27, 2010 2:46 PM UTC

I wish I did have the anneal function. Of all the functions in the NR extension pack, that is the one I miss the most. If I had much more time than I do, I would rewrite it as a Mathcad function.

Sep 1, 2010 6:23 AM UTC

Thank You!

I am looking for!

Oct 17, 2010 5:00 AM UTC

Is continued in the Pro/E forum:

http://communities.ptc.com/message/153959