3-opt

In optimization, 3-opt is a simple local search algorithm for solving the travelling salesman problem and related network optimization problems. 3… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1991-2016
051019912016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This paper presents an improved chaotic ant colony system algorithm (ICACS) for solving combinatorial optimization problems. The… (More)
  • figure 3.1
  • table 4.1
  • table 4.2
  • figure 4.1
Is this relevant?
2012
2012
We are presenting a high-performance GPU implementation of a 2-opt and 3-opt algorithms used to solve the Traveling Salesman… (More)
  • figure 1
  • figure 2
  • table I
Is this relevant?
2012
2012
Since material handling agents in a FMS are most efficient when moving in straight lines, a common layout of machines in a FMS is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • 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?
2008
2008
  • Yu-Hsin Liu
  • European Journal of Operational Research
  • 2008
This paper focuses on introducing a concept of diversified local search strategy under the scatter search framework for the… (More)
Is this relevant?
2007
2007
A new genetic algorithm for the solution of the travelling salesman problem is presented in this paper. The approach is to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
In this paper we proposed a new algorithm based on Inver-over operator, for traveling salesman problems (TSP). Inver-over is… (More)
  • table 1
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We introduce a meta-heuristic to combine simulated annealing with local search methods for CO problems. This new class of Markov… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We consider a new class of optimization heuristics which combine local searches with stochastic sampling methods, allowing one to… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We int rodu ce a new class of Markov chain Monte Carlo search pr ocedures tha t lead to mor e powerful optimization met hods than… (More)
Is this relevant?