# 2-opt

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- 2017

To accelerate the solution for large scale traveling salesman problems (TSP), a parallel 2-opt local search algorithm with simpleâ€¦Â (More)

Is this relevant?

2016

2016

- 2016

Harmony search algorithm that matches the (Î¼+1) evolution strategy, is a heuristic method simulated by the process of musicâ€¦Â (More)

Is this relevant?

2013

2013

- Networks
- 2013

The k -opt heuristics are among the most common techniques for approaching the traveling salesman problem (TSP). They are usedâ€¦Â (More)

Is this relevant?

2011

2011

- 2011

The Traveling Salesman Problem (TSP) is a famous NP-hard problem typically solved using various heuristics. One of popularâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Algorithmica
- 2006

<i>2-Opt</i> is probably the most basic and widely used local search heuristic for the TSP. This heuristic achieves amazinglyâ€¦Â (More)

Is this relevant?

2005

2005

- GECCO
- 2005

Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSPâ€¦Â (More)

Is this relevant?

2004

2004

- IEEE International Conference on Systems, Man andâ€¦
- 2004

Our proposed method gives genes the priority for mutation and intersection operations. The priority of genetic locus changes byâ€¦Â (More)

Is this relevant?

2002

2002

- SBIA
- 2002

This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Minimization Open Stack Problem (MOSP). Theâ€¦Â (More)

Is this relevant?

1998

1998

- PPSN
- 1998

Optimal results for the Traveling Salesrep Problem have been reported on problems with up to 3038 cities using a GA with Edgeâ€¦Â (More)

Is this relevant?

1995

1995

- Future Generation Comp. Syst.
- 1995

We present a scalable parallel local search algorithm based on data parallelism. The concept of distributed neighborhoodâ€¦Â (More)

Is this relevant?