This paper presents the results of a research that resolves the problem of finding the optimal scheduling trip plan for tourists. This problem can be presented as a travel salesman problem extension, where is necessary to find an optimal route to visit all the places of interest available for tourist. The contribution of this research is a novel solution that helps to solve the problem of optimizing the schedule of a tourists trip plan in a scenario like a city with confuse streets directions and many places to visit, the solution developed allows to minimize the total distance traveled by tourists to visit each of the places of interest without repeating a place and return back to the starting point choosing the most efficient route.