Java: Traveling Salesman Problem
July 22, 2011
Another AI project, where we had to solve the Traveling Salesman Problem. My solution is quite dumb, basically it is a simple heuristical search, where the tour of the cities is calculated by alwasy traveling to the nearest not yet visited city. I guess I put more effort into the graphics than into solving the problem itself, nevertheless I got max points to the assignment. The program uses Swing to draw graphics and the interface is in Estonian again.
Download the source code: TravelingSalesman-
Source.zip (4.6 MB)