Resumen
The water flow-like algorithm (WFA) is a relatively new metaheuristic algorithm, which has shown good solution for the Travelling Salesman Problem (TSP) and is comparable to state of the art results. There are various factor influence the performance of WFA for TSP. However, initial solution has also influence the performance of the algorithm. The basic of WFA uses a random searching method for initialization technique. Previous WFA-TSP used Nearest Neighbor for initial solution. Therefore this paper presents the performance of use Simulated Annealing in initial solution for WFA-TSP. The algorithms are evaluated using 16 benchmarks TSP datasets. The experimental results show that the proposed SA-WFA-TSP outperforms due to its capacity of reduce computing time compared with others algorithms especially for large dataset. Therefore, it can be concluded that SA-WFA-TSP has become the state of the art algorithm for TSP.Keywords: Nature-inspired Metaheuristics, Water Flow Liked Algorithm, Simulated Annealing Algorithm, Combinatorial Optimization, Traveling Salesman ProblemJEL Classifications: C22, C61