i have to find a round trip for an Edinburgh bike club (data below) using two approaches: a) a conventional search algorithm; b) a genetic algorithm

What i must do :
1.  Produce a program using a search algorithm of your choice that will find a ‘good’ circuit from Edinburgh that visits all the towns. 
2.  Produce a program using a GA approach that will also find a ‘good’ circuit

Cycle tour data



    Aberdeen    
    179     Ayr 
    129     79   Edinburgh  
    157     141  131       Fort William 
    146     33   43       116          Glasgow  
    105     207  154      64(74)**      175    Inverness    
    79      118  50       134           81      145      St Andrews 
    119      64  36       96            27      143         52      Stirling



** Note that due to roadworks between Fort William and Inverness, all traffic in the Inverness direction is being diverted adding an extra 10 miles onto the trip.


Can somebody suggest some Java implementations that he has experience with?

I am very grateful for all advice/examples/explanations/links!

Thank you!

ah, another attempt at solving the traveling salesman problem by dumping the problem in a public forum for others to solve...

This article has been dead for over six months. Start a new discussion instead.