This paper presents hybrid technique using two metahueristic methods; which are simulated annealing (SA) and tabu search (TS). The aim is to exhibit the facility of adaptive memory in tabu search method to resolve the long computation times of simulated annealing metaheuristic method. This can be done by keeping the best path which is found in each iteration. As a result, the proposed hybrid technique gives the optimum solution by finding the shortest path with minimum cost when applied on travelling salesman problem (TSP) since it reduces the time complexity by finding the optimum path with a few numbers of iterations when compared with SA and TS.