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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
To accelerate the solution for large scale traveling salesman problems (TSP), a parallel 2-opt local search algorithm with simple… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
2016
2016
Harmony search algorithm that matches the (μ+1) evolution strategy, is a heuristic method simulated by the process of music… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
  • table 4
Is this relevant?
2013
2013
The k -opt heuristics are among the most common techniques for approaching the traveling salesman problem (TSP). They are used… (More)
  • figure 1
  • figure 4
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
2011
2011
The Traveling Salesman Problem (TSP) is a famous NP-hard problem typically solved using various heuristics. One of popular… (More)
  • figure 1
  • figure 3
  • figure 4
  • table 1
  • figure 6
Is this relevant?
Highly Cited
2006
Highly Cited
2006
<i>2-Opt</i> is probably the most basic and widely used local search heuristic for the TSP. This heuristic achieves amazingly… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2005
2005
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
Is this relevant?
2004
2004
Our proposed method gives genes the priority for mutation and intersection operations. The priority of genetic locus changes by… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2002
2002
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Minimization Open Stack Problem (MOSP). The… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1998
1998
Optimal results for the Traveling Salesrep Problem have been reported on problems with up to 3038 cities using a GA with Edge… (More)
Is this relevant?
1995
1995
We present a scalable parallel local search algorithm based on data parallelism. The concept of distributed neighborhood… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?