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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
This article presented a parallel cooperative hybrid algorithm for solving traveling salesman problem. Although heuristic… 
Highly Cited
2013
Highly Cited
2013
Highly Cited
2008
Highly Cited
2008
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this… 
Highly Cited
2006
Highly Cited
2005
Highly Cited
2005
This article analyzes the performance of metaheuristics on the vehicle routing problem with stochastic demands (VRPSD). The… 
2004
2004
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
Highly Cited
1992
Highly Cited
1992