This page contains an archived post to the Java Answers Forum made prior to February 25, 2002. If you wish to participate in discussions, please visit the new Artima Forums.

Message:

interesting project

Posted by tricky on February 21, 2002 at 10:40 AM

Have you ever heard of TSP, the Travelling samesman problem ?
Suppose n points in a plane, they represent e.g. stations the salesman has to visit. Now look for the shortest path to visit all stations.
This problem is very well known in theoretical informatic.
Just look for np - hard problems.
I think this problem is interesting bevause you can try many different algorithms. (threshold accepting, greedy..) YOu can implement a graphical interface for input and output and so on.
Regards