3-opt is an optimization algorithm commonly used in the context of solving the Traveling Salesman Problem (TSP) and other routing problems. It is a local search improvement technique that refines a given tour (a sequence of vertices) by exploring small changes to reduce the overall tour length. The algorithm works by considering all possible ways to remove three edges from the tour and reconnect the resulting segments in a different way to create a new tour.
New to topics? Read the docs here!