Tabu Search Algorithm Deconstruction

It was developed with the Python language. In this study, the distances between 15 cities were considered as a matrix. Dec. As a result of the study initiated by selecting the number of iterations and the random starting route, the traveling seller problem was addressed by visiting all cities. In this problem, in order to complete the sellers 15 cities with the shortest distance, tabu search brings us the result that is close to the optimum with the iteration specified by the search.

Technologies Used