Methods (TSP)

Back to TSP page

The following are links to java applets to demonstrate the methods used.

  • 'parallel dilation' 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 'parallel dilation' 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



Any comments welcome.
contact: i.mitchell@mdx.ac.uk , phil@www.uroborus-software.co.uk