Algorithm shortest path between all points

Posted by Jeroen on Stack Overflow See other posts from Stack Overflow or by Jeroen
Published on 2010-03-23T16:30:12Z Indexed on 2010/03/23 16:33 UTC
Read the original article Hit count: 564

Hi,

suppose I have 10 points. I know the distance between each point.

I need to find the shortest possible route passing trough all points.

I have tried a couple of algorithms (Dijkstra, Floyd Warshall,...) and the all give me the shortest path between start and end, but they don't make a route with all points on it.

Permutations work fine, but they are to resource expensive.

What algorithms can you advise me to look into for this problem? Or is there a documented way to do this with the above mentioned algorithms?

Tnx Jeroen

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about artificial-intelligence