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.
2018
2018
An Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in… 
2011
2011
The Way of Solving Traveling Salesman Problem the Research on Scheduling in AS/RS
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… 
2011
2011
Comparing Genetic Algorithms and Simulated Annealing for Solving the Pickup and Delivery Problem with Time Windows
Solving the Vehicle Routing Problem (VRP) and its related variants is significant for optimizing logistic planning. One important… 
2008
2008
A Hybrid Cellular Genetic Algorithm for the Capacitated Vehicle Routing Problem
Cellular genetic algorithms (cGAs) are a kind of genetic algorithm (GA) — population based heuristic — with a structured… 
2005
2005
Embedded local search approaches for routing optimization
2003
2003
An N-parallel Multivalued Network: Applications to the Travelling Salesman Problem
In a competitive neural network, a process unit (node) in the competitive layer is completely described by the vector of weight… 
Highly Cited
1998
Highly Cited
1998
A bicriteria two-machine permutation flowshop problem
Highly Cited
1998
Highly Cited
1998
Optimizing tabu list size for the traveling salesman problem
1996
1996
Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
  • F. Glover
  • J. Heuristics
  • 1996
  • Corpus ID: 35063097
A special class of 4-opt moves plays a key role in several leading heuristics for the traveling salesman problem (TSP). However… 
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)