The following are links to java applets to demonstrate the methods used.
- 'ripple OUT' uses dilating circles, starting simultaneously. When the circles overlap the two nodes are connected. A node may only join two others. This method is quiet successful with small numbers of nodes.
- 'ripple IN' uses decreasing circles. This method seems to find the longest route, the travelling salesman on expenses.
- 'next nearest' and '3 moves plan' look 1 and 3 moves ahead to decide the next node to visit.
- By introducing a temporal delay to certain circles, the 'ripple out' method may be improved by removing paths that overlap. By representing the nodes' delays as a chromosome, a 'Genetic algorithm' is used to find a fitter i.e. shorter route. The results have been near optimal routes.results
- Random positioning (15colonies)
- Grid positioning - (30 colonies)
- Euclidean Planar - (92 colonies)
- Lalina positioning - (30 colonies)
- bayg29 TSPLIB - (29 colonies)
- berlin52 TSPLIB - (52 colonies)
- pr76 TSPLIB - (76 colonies)
- eil51 TSPLIB - (51 colonies)
- eil76 TSPLIB - (76 colonies)
- rd100 TSPLIB - (100 colonies)
- st70 TSPLIB - (70 colonies)
- gr24 TSPLIB - (24 colonies)
- gr48 TSPLIB - (48 colonies)
Asymmetric TSP
- ftv33 TSPLIB - (34 colonies)
