FAQ

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

Related topics

Related topics

5 relations
2-optLin–Kernighan heuristicLocal search

Broader (2)

Mathematical optimizationTravelling salesman problem

Related mentions per year

Related mentions per year

1937-2018
19401960198020002020
3-opt
Mathematical optimization
Local search
Travelling salesman problem
2-opt
Lin–Kernighan heuristic

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
An Improved Ant Colony Algorithm Based on 3-opt and Chaos for Travelling Salesman Problem
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
Accelerating 2-opt and 3-opt local search using GPU in the travelling salesman problem
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
Tabu search for the single row facility layout problem in FMS using a 3-opt neighborhood
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
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… (More)
  • figure 1
  • figure 3
  • figure 4
  • table 1
  • figure 6
Is this relevant?
2008
2008
Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem
  • 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
Solving Large Travelling Salesman Problems with Small Populations
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
A Fast Evolutionary Algorithm for Traveling Salesman Problem
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
Combining Simulated Annealing with Local Search Heuristics
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
Large - Step Markov Chains for the TSPIncorporating
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
Large-Step Markov Chains for the Traveling Salesman Problem
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?