Tabusearch

About

This application visualizes the tabu search algorithm. You can choose to optimize a predefined Function or a travelling salesman problem. It always tries to find the lowest value (the brightest pixel).

Manual

The main bar

  • Problem: Choose a problem from the list.
  • Size: The size of the problem - only valid for TSP problems.
  • New Size: The number of neighbours to be calculated. If it is 0 it calculates all possible neighbours.
  • Tabu Size: The number of tabued solutions.

The problem bar

  • Best Solution: The value of the best solution that has been found. Move your mouse over it, to see the solution.
  • Solutions calculated: The total number of calculated solutions.
  • New Size: The number of neighbours to be calculated each step. If it is 0 it calculates all possible neighbours.
  • Tabu Size: The number of tabued solutions.
  • Show Tabus: Display all tabued solutions.

The control bar

  • Step: Calculate one step.
  • Step x10: Calculate ten steps.
  • Step x100: Calculate a hundred steps.
  • Auto: Automatically calculate steps in defined intervals.

The Solution Chart


Shows the past values. A green segment shows an improvement, a red segment shows a change for the worse. Move your mouse over it, to see the past solutions.

Paper


2008 Max Nagl
Web-design, development and programming by Max Nagl