Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 209,921,004 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
2-opt
Lin–Kernighan heuristic
Local search (optimization)
Broader (2)
Mathematical optimization
Travelling 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
Şaban Gülcü
,
Mostafa Mahi
,
Ö. K. Baykan
,
H. Kodaz
Soft Computing - A Fusion of Foundations…
2018
Corpus ID: 31405932
This article presented a parallel cooperative hybrid algorithm for solving traveling salesman problem. Although heuristic…
Expand
Highly Cited
2013
Highly Cited
2013
Parallel Ant Colony Optimization on Graphics Processing Units
Audrey Delevacq
,
P. Delisle
,
M. Gravel
,
M. Krajecki
J. Parallel Distributed Comput.
2013
Corpus ID: 11554504
Highly Cited
2009
Highly Cited
2009
A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
Hipólito Hernández-Pérez
,
Inmaculada Rodríguez Martín
,
Juan José SALAZAR-GONZÁLEZ
Computers & Operations Research
2009
Corpus ID: 14879167
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
L. Wong
,
M. Low
,
C. Chong
6th IEEE International Conference on Industrial…
2008
Corpus ID: 1648337
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this…
Expand
Highly Cited
2006
Highly Cited
2006
Computing nine new best-so-far solutions for Capacitated VRP with a cellular Genetic Algorithm
E. Alba
,
B. Dorronsoro
Information Processing Letters
2006
Corpus ID: 6272996
Highly Cited
2005
Highly Cited
2005
Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands
L. Bianchi
,
M. Birattari
,
+5 authors
T. Schiavinotto
J. Math. Model. Algorithms
2005
Corpus ID: 13985294
This article analyzes the performance of metaheuristics on the vehicle routing problem with stochastic demands (VRPSD). The…
Expand
2004
2004
Applying Metaheuristics to Feeder Bus Network Design Problem
S. Kuan
,
H. Ong
,
K. Ng
Asia Pac. J. Oper. Res.
2004
Corpus ID: 31945293
This paper proposes the design and analysis of two metaheuristics, simulated annealing (SA) and tabu search (TS), for solving the…
Expand
Highly Cited
1998
Highly Cited
1998
Simulated annealing for order spread minimization in sequencing cutting patterns
H. Foerster
,
G. Wäscher
European Journal of Operational Research
1998
Corpus ID: 6628823
Highly Cited
1992
Highly Cited
1992
Large-step markov chains for the TSP incorporating local search heuristics
O. Martin
,
S. Otto
,
E. Felten
Operations Research Letters
1992
Corpus ID: 14609132
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)
ACCEPT & CONTINUE