On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem

TL;DR

This paper proves that the k-Opt local search algorithm for the Traveling Salesman Problem is PLS-complete for k ≥ 15, significantly lowering the previously known threshold and confirming its computational complexity.

Contribution

It provides the first rigorous proof of PLS-completeness for k-Opt with k ≥ 15, addressing an open problem and improving upon prior results requiring much larger k.

Findings

k-Opt local search is PLS-complete for k ≥ 15

The proof applies to both general and metric TSP cases

Addresses an open question from prior research

Abstract

The $k$-Opt algorithm is a local search algorithm for the traveling salesman problem. Starting with an initial tour, it iteratively replaces at most $k$ edges in the tour with the same number of edges to obtain a better tour. Krentel (FOCS 1989) showed that the traveling salesman problem with the $k$-Opt neighborhood is complete for the class PLS (polynomial time local search). However, his proof requires $k \gg 1000$ and has a substantial gap. We provide the first rigorous proof for the PLS-completeness and at the same time drastically lower the value of $k$ to $k \geq 15$, addressing an open question by Monien, Dumrauf, and Tscheuschner (ICALP 2010). Our result holds for both the general and the metric traveling salesman problem.