Skip to search formSkip to main contentSkip to account menu

2-opt

Known as: 2-opt operator 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
3-optLin–Kernighan heuristicLocal search (optimization)Vehicle routing problem

Broader (2)

Mathematical optimizationTravelling salesman problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Vehicle Routing to Multiple Warehouses Using a Memetic Algorithm
Highly Cited
2012
Highly Cited
2012
A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems
2011
2011
Combining 2-opt , 3-opt and 4-opt with K-swap-kick Perturbations for the Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is a famous NP-hard problem typically solved using various heuristics. One of popular… 
2011
2011
An Enhanced Nested Partitions Algorithm Using Solution Value Prediction
Metaheuristics are an important branch of optimization algorithms that attract lots of research and application efforts. In this… 
2010
2010
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we… 
2004
2004
A genetic algorithm with the improved 2-opt method
Our proposed method gives genes the priority for mutation and intersection operations. The priority of genetic locus changes by… 
Highly Cited
2003
Highly Cited
2003
A neural network algorithm for the traveling salesman problem with backhauls
2000
2000
Application of the noising method to the travelling salesman problem
Highly Cited
1998
Highly Cited
1998
A bicriteria two-machine permutation flowshop problem
Highly Cited
1998
Highly Cited
1998
Optimizing tabu list size for the traveling salesman problem
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)