S-Metaheuristics Approach to Solve Traveling Salesman Problem

Abstract

Metaheuristic algorithm is a state of the art optimization method which suitable for solving large and complex problem. Single solution technique – Smetaheuristic is one of metaheuristic algorithm that search near optimal solution and known as exploitation based. The research conducted to seek a better solution for deliverying goods to 29 destinations by comparing two well known optimization methods that can produce the shortest distance: Simulated Annealing (SA) and Tabu Search (TS). The result shows that TS – 107 KM has a shorter distance than SA – 119 KM. Exploration based method should be conducted for next research to produce information in which one is a better method