The GA Playground: TSP Demo

 

A simple TSP where all the cities are located on a circle.

Description:

The Traveling Salesman Problem: A hypothetical salesmen must make a complete tour of a given set of cities in the order that minimizes his total distance traveled

Formulation:

Given a set of n nodes and the coordinates of each node, find a round trip of minimum total length visiting each node exactly once. The distance from node i to node j is the same as from node j to node i (Symmetric TSP).

Problem Specific Notes:

Instructions:

You either do not have Java support or it is disabled in your browser


Ariel Dolan
aridolan@netvision.net.il