"Applying Speed-Up Techniques to Local Search and Solving the Traveling Salesman Problem" Maša Avakumović and Martin Josef Geiger The main goal of our work is to quickly find a high-quality approximation for a Traveling Salesman Problem (TSP) solution. In our approach we used the logic of the Iterated Local Search (ILS) with adequate initialization methods and efficient implementation techniques, which contribute to the faster convergence towards the optimal solution. An independent assessment and comparison with other implementation methods was carried out on the optil.io platform, where we currently hold the top 2 positions.