|
|||
|
Teaching Aids
This section is not yet developed. Whether teaching Operations Research, Business Management, or Artificial Intelligence, tabu search should be of interest to the teacher for its strengths in solving previously-intractable, discrete-solution problems such as the Knapsack Problem and the Traveling Salesman Problem. The following pages are for teachers' and students' benefits to introduce them to the tabu search meta-heuristic and provide an opportunity to experiment with building their own tabu searches, possibly with the aid of OpenTS, a framework for building structured tabu searches in the Java programming language.
|
||