On the neighborhood structure of the traveling salesman problem generated by local search moves
From MaRDI portal
Publication:2468271
DOI10.1007/s10955-007-9382-1zbMath1145.90437OpenAlexW2149263578MaRDI QIDQ2468271
Markus Dankesreiter, Florian Baumgartner, Günther Stattenberger, Johannes J. Schneider
Publication date: 22 January 2008
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10955-007-9382-1
Related Items (3)
Variable neighbourhood structures for cycle location problems ⋮ Traveling salesman problem with clustering ⋮ Pattern discrete and mixed hit-and-run for global optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem
- The traveling salesman. Computational solutions for RSP applications
- A computational study of smoothing heuristics for the traveling salesman problem
- Metaheuristic optimization via memory and evolution. Tabu search and scatter search.
- Nonlinear optimization simplified by hypersurface deformation.
- Record breaking optimization results using the ruin and recreate principle
- Stochastic Optimization
- On the approach to the equilibrium and the equilibrium properties of a glass-forming model
- Searching for Backbones—a high-performance parallel algorithm for solving combinatorial optimization problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Genetic Algorithms and the Optimal Allocation of Trials
- The landscape of the traveling salesman problem
This page was built for publication: On the neighborhood structure of the traveling salesman problem generated by local search moves
