Tabu Search (TS)

Tabu Search (TS) usually used in scalarization approach that uses a combination with the local search algorithm. It was initially designed for single-objective combinatorial optimization problems that works via iterative basis by searching for an improved solution in the neighbourhood area of the current solution. To find the improved solution, TS uses a short-term memory called a tabu list to record the recently visited solutions. All the new solution candidates that already listed inside the tabu list are unable to be visited again during this search stage. This procedure is executed to avoid the endless cycle of searching thus avoiding the solution from getting stuck in local optimum.