Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

3-opt

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

Related topics

Related topics

5 relations
2-optLin–Kernighan heuristicLocal search (optimization)

Broader (2)

Mathematical optimizationTravelling salesman problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem
This article presented a parallel cooperative hybrid algorithm for solving traveling salesman problem. Although heuristic… Expand
Is this relevant?
Highly Cited
2015
Highly Cited
2015
A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is one of the standard test problems used in performance analysis of discrete optimization… Expand
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Parallel Ant Colony Optimization on Graphics Processing Units
The purpose of this paper is to propose effective parallelization strategies for the Ant Colony Optimization (ACO) metaheuristic… Expand
  • figure 1
Is this relevant?
2012
2012
Accelerating 2-opt and 3-opt local search using GPU in the travelling salesman problem
In this paper we are presenting high performance GPU implementations of the 2-opt and 3-opt local search algorithms used to solve… Expand
Is this relevant?
2012
2012
Accelerating 2-opt and 3-opt local search using GPU in the travelling salesman problem
In this paper we are presenting high performance GPU implementations of the 2-opt and 3-opt local search algorithms used to solve… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • table I
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… Expand
  • figure 1
  • figure 3
  • figure 4
  • table 1
  • figure 6
Is this relevant?
2005
2005
Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem
The general routing problem (GRP) is the problem of finding a minimum length tour, visiting a number of specified vertices and… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
1996
1996
Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
A special class of 4-opt moves plays a key role in several leading heuristics for the traveling salesman problem (TSP). However… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Large-step markov chains for the TSP incorporating local search heuristics
We consider a new class of optimization heuristics which combine local searches with stochastic sampling methods, allowing one to… Expand
  • table 1
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Large-Step Markov Chains for the Traveling Salesman Problem
We introduce a new class of Markov chain Monte Carlo search procedures, leading to more powerful optimizat~on methods than… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE