Proposal of Backtracked Tabu Search (BTS) Algorithm

Abstract

There are several heuristic search techniques, Tabu Search (TS) is one of them.TS based on generating the neighbor states but it has several problems in its work.This paper presents a new version of TS based on backtracking techniques (calledBTS) to reduce the effect of these problems. Two case studies have been solved usingBTS, 4-Color Map and Traveling Salesman Problem. The proposed algorithm givesgood results compare with the original, the iteration numbers are less and the localminimum or non-optimal solutions are less.