The GA Playground: TSP Test Problem Bayg29 handled by genetic algorithm

The GA Playground: TSP Test Problem Bayg29

29 Cities in Bavaria (Groetschel,Juenger,Reinelt)

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:

Test Problem: 29 Cities in Bavaria (Groetschel,Juenger,Reinelt)
The problem definition file is TspBayg29.par
The problem mapping (coordinates) file is TspBayg29.gmp

Instructions:

The applet requires a browser that supports JDK 1.1.5 or above
The applet has a relatively long loading time
Hide browser's toolbars to make the whole applet visible without scrolling
Optionally select 'Parameters' from the 'GA' menu to modify problem attributes
Select 'Execute' from the 'GA' menu to run the program
Status bar help tips can be toggled On or Off through the 'Options' menu
Text window reporting can be toggled On or Off through the 'Options/Switches' menu

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

Ariel Dolan
aridolan@netvision.net.il