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.
2017
2017
A Randomness Ant Colony Algorithm for Solving TSP
The Travelling Salesman Problem (TSP) has received much attention because of its practical applications in several problems. One… 
2016
2016
Diagnosis of faults in plant operations and scheduling under uncertain production times
................................................................................................................................... iii Acknowledgments.................................................................................................................... iv Table of 
2016
2016
A novel GRASP based on mixed k-opt method for the Traveling Salesman Problem
Objective: A novel Greedy Randomized Adaptive Search Procedure was proposed in this paper to resolve the traveling salesman… 
2016
2016
Title: Developing a Dynamic Neighborhood Structure for an Adaptive Hybrid Simulated Annealing – Tabu Search Algorithm to Solve the Symmetrical Traveling Salesman Problem
This paper applies a hybrid simulated annealing – tabu search algorithm to solve the Traveling Salesman Problem (TSP). Fully… 
2012
2012
Tabu search for the single row facility layout problem in FMS using a 3-opt neighborhood
Since material handling agents in a FMS are most efficient when moving in straight lines, a common layout of machines in a FMS is… 
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… 
2010
2010
Ant colony for TSP
The aim of this work is to investigate Ant Colony Algorithm for the traveling salesman problem (TSP). Ants of the artificial… 
2005
2005
A Variable Neighbourhood Monte Carlo Search For Multi-Head Surface Mount Device Placement Machine
  • 2005
  • Corpus ID: 35127381
2000
2000
An Improved Discrete Neural Network Algorithm for the Traveling Salesman Problem
The simplest and most famous of the classical local optimization algorithms for the Traveling Salesman Problem (TSP) is the 2-opt… 
1997
1997
2nd International Conference on Metaheuristics -mic97 Max{min Ant System and Local Search for Combinatorial Optimization Problems
In this paper we present an extension of MAX{MIN Ant System applying it to Traveling Salesman Problems and Quadratic Assignment…