language-icon Old Web
English
Sign In

2-opt

In optimization, 2-opt is a simple local search algorithm first proposed by Croes in 1958 for solving the traveling salesman problem. The main idea behind it is to take a route that crosses over itself and reorder it so that it does not. In optimization, 2-opt is a simple local search algorithm first proposed by Croes in 1958 for solving the traveling salesman problem. The main idea behind it is to take a route that crosses over itself and reorder it so that it does not. A complete 2-opt local search will compare every possible valid combination of the swapping mechanism. This technique can be applied to the travelling salesman problem as well as many related problems. These include the vehicle routing problem (VRP) as well as the capacitated VRP, which require minor modification of the algorithm.

[ "Genetic algorithm", "Combinatorial optimization", "Travelling salesman problem", "Lin–Kernighan heuristic", "euclidean traveling salesman problem", "Traveling purchaser problem", "Christofides algorithm" ]
Parent Topic
Child Topic
    No Parent Topic