Skip to search formSkip to main contentSkip to account menu

3-opt

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

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.
Highly Cited
2018
Highly Cited
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… 
Highly Cited
2013
Highly Cited
2013
Parallel Ant Colony Optimization on Graphics Processing Units
Highly Cited
2009
Highly Cited
2009
A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
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
  • Corpus ID: 3128102
Highly Cited
2008
Highly Cited
2008
Bee Colony Optimization with local search for traveling salesman problem
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this… 
Highly Cited
2006
Highly Cited
2006
Computing nine new best-so-far solutions for Capacitated VRP with a cellular Genetic Algorithm
Highly Cited
2005
Highly Cited
2005
Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands
This article analyzes the performance of metaheuristics on the vehicle routing problem with stochastic demands (VRPSD). The… 
2004
2004
Applying Metaheuristics to Feeder Bus Network Design Problem
This paper proposes the design and analysis of two metaheuristics, simulated annealing (SA) and tabu search (TS), for solving the… 
Highly Cited
1998
Highly Cited
1998
Simulated annealing for order spread minimization in sequencing cutting patterns
Highly Cited
1992
Highly Cited
1992
Large-step markov chains for the TSP incorporating local search heuristics
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)