Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,977,006 papers from all fields of science
Search
Sign In
Create Free Account
2-opt
Known as:
2-opt operator
In optimization, 2-opt is a simple local search algorithm first proposed by Croes in 1958 for solving the traveling salesman problem. The main idea…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
3-opt
Lin–Kernighan heuristic
Local search (optimization)
Vehicle routing problem
Broader (2)
Mathematical optimization
Travelling salesman problem
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem
Samadhi Nallaperuma
,
Markus Wagner
,
F. Neumann
,
B. Bischl
,
Olaf Mersmann
,
H. Trautmann
FOGA XII '13
2013
Corpus ID: 4991990
Understanding the behaviour of well-known algorithms for classical NP-hard optimisation problems is still a difficult task. With…
Expand
2012
2012
Tabu search for the single row facility layout problem in FMS using a 3-opt neighborhood
R. Kothari
,
D. Ghosh
2012
Corpus ID: 14034688
Since material handling agents in a FMS are most efficient when moving in straight lines, a common layout of machines in a FMS is…
Expand
2011
2011
Comparing Genetic Algorithms and Simulated Annealing for Solving the Pickup and Delivery Problem with Time Windows
M. Hosny
2011
Corpus ID: 6376826
Solving the Vehicle Routing Problem (VRP) and its related variants is significant for optimizing logistic planning. One important…
Expand
2010
2010
Ant colony for TSP
Yin Feng
2010
Corpus ID: 59822152
The aim of this work is to investigate Ant Colony Algorithm for the traveling salesman problem (TSP). Ants of the artificial…
Expand
2006
2006
Spatial harvest scheduling in the Southeastern United States
Jianping Zhu
2006
Corpus ID: 133879004
2004
2004
A genetic algorithm with the improved 2-opt method
Mitsukuni Matayoshi
,
Morikazu Nakamura
,
H. Miyagi
IEEE International Conference on Systems, Man and…
2004
Corpus ID: 25777230
Our proposed method gives genes the priority for mutation and intersection operations. The priority of genetic locus changes by…
Expand
2004
2004
Ants for Sampling in the Nested Partition Algorithm
Sameh Al-Shihabi
Hybrid Metaheuristics
2004
Corpus ID: 13949165
The Nested Partition algorithm suffers from the lack of information gathering and sharing despite the computational effort…
Expand
2004
2004
A Genetic Algorithm with the Improved 2-opt Method for Quadratic Assignment Problem
Mitsukuni Matayoshi
,
Morikazu Nakamura
,
H. Miyagi
2004
Corpus ID: 122166305
We propose a new 2-opt base method as a local search approach used with Genetic Algorithms (GAs) in Memetic Algorithm. We got a…
Expand
2003
2003
Efficiency of selected meta-heuristics applied to the TSP problem: a simulation study
H. Kwasnicka
,
H. Kwasnicka
2003
Corpus ID: 9582733
The paper presents a simulation study of the usefulness of a number of meta-heuristics used as optimisation methods for TSP…
Expand
1976
1976
Common feature techniques for discrete optimization
A. Goldstein
,
A. Lesk
Design Automation Conference
1976
Corpus ID: 23251
We present a general approach to finding optimal arrangements of objects, given a cost function for evaluating an arrangement…
Expand