Exponential neighbourhood local search for the traveling salesman problem

@article{Gutin1999ExponentialNL,
  title={Exponential neighbourhood local search for the traveling salesman problem},
  author={Gregory Gutin},
  journal={Computers & OR},
  year={1999},
  volume={26},
  pages={313-320}
}
Scope and Purpose { While exact algorithms can only be used for solving small or quite moderate instances of the traveling salesman problem (TSP), local search remains the main practical tool for nding near optimal solutions for large scale instances. Exponential neighbourhood local search (ENLS) is a relatively new direction in local search for the TSP. In ENLS, one nds the best among very large, exponential, number of tours. Computational experiments reported by several researches demonstrate… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 17 references

A study of exponential neighbourhoods for the traveling salesman problem and the quadratic assiggnment problem

V Deineko, G J Woeginger
A study of exponential neighbourhoods for the traveling salesman problem and the quadratic assiggnment problem • 1997

Linear time dynamic programming algorithms for some new classes of restricted TSP's

E Balas, N Simonetti
Proc. IPCO V • 1996

Dynasearch -Iterative local improvement by dynamic programming: Part I, the travelling salesman problem The Netherlands

C N Potts, S L Van De Velde
Dynasearch -Iterative local improvement by dynamic programming: Part I, the travelling salesman problem The Netherlands • 1995

The Traveling Salesman

Lecture Notes in Computer Science • 1994

Ejection chains, reference structures, and alternating path algorithms for traveling salesman problem

Glover
Research Report. Univ. Colorado-Boulder • 1992

On the eeciency of a local algorithm for solving the traveling salesman problem. Automation and Remote Control

G Gutin
On the eeciency of a local algorithm for solving the traveling salesman problem. Automation and Remote Control • 1988

Similar Papers

Loading similar papers…