2321 ISSN 2286-4822 www.euacademic.org EUROPEAN ACADEMIC RESEARCH Vol. IV, Issue 3/ June 2016 Impact Factor: 3.4546 (UIF) DRJI Value: 5.9 (B+) Solving the Traveling Salesman Problem using Google Services and Simulated Annealing Algorithm LAURIK HELSHANI 1 PhD(c), European University of Tirana Tirana, Albania Abstract: The concept of the traveling salesman problem is to seeking a tour of a specified number of cities (visiting each city exactly once and returning to the starting point) where the length of the tour is minimized. The mathematical modeling of this problem has to do with the theory of graphs. In this paper, I examine simulated annealing algorithm in the context of solving the traveling salesman problem. Test-tool programming is done in JAVA programming language and his work is displayed graphically using the 2D library. The whole system is programmed as client-server system using RESTFul web services, Google-services and Simulated Annealing Algorithm. Google services are used to determine the optimum route on Google map and solve the Travelling Salesman problem. Key words: Traveling Salesman Problem (TSP); Simulated Annealing Algorithem (SA); Google Services; RESTful; JAVA 1 Laurik Helshani is PhD candidate at Faculty of Economics. Profile: Management Information Systems in European University of Tirana (UET). His PhD thesis: ―Solving Travelling Salesman Problem using Genetic Algorithm and programming android smart-phones‖.