Author
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 (called
BTS) to reduce the effect of these problems. Two case studies have been solved using
BTS, 4-Color Map and Traveling Salesman Problem. The proposed algorithm gives
good results compare with the original, the iteration numbers are less and the local
minimum or non-optimal solutions are less.
)
