Survey on Tabu Search meta-heuristic optimization

The optimization techniques are adopted nearly in all domains to find best solution from the feasible solutions. It is NP-hard to solve problems with partial information and few assumptions. Various meta-heuristic techniques are applied to optimize the solution; one among them is Tabu Search (TS) which gives solution nearer to the optimum with high speed and precision. Initially Tabu Search is applied to various combinatorial problems that have appeared in the operations research literature. Tabu Search relieves local search method from local optima problem, and start finding the solution from single point, finds application mostly in all areas in computer science including VANET, Software Development Effort Estimation, Quadratic Assignment problem, etc., for their efficiency. This paper provides the survey of Tabu Search for different optimization problems along with the hybridization technique with other heuristic algorithms. Finally, the summarization of all the works under Tabu Search was explored.