The Traveling Salesman Problem (TSP), a quintessential challenge in computational theory, involves finding the shortest route that visits each city exactly once before returning to the starting point.

We are providing an unedited version of this manuscript to give early access to its findings. Before final publication, the manuscript will undergo further editing. Please note there may be errors ...