On the neighborhood structure of the traveling salesman problem generated by local search moves
From MaRDI portal
Publication:2468271
DOI10.1007/S10955-007-9382-1zbMATH Open1145.90437OpenAlexW2149263578MaRDI QIDQ2468271FDOQ2468271
Authors: Günther Stattenberger, Markus Dankesreiter, Florian Baumgartner, Johannes 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
Recommendations
- New Results on the Old k-opt Algorithm for the Traveling Salesman Problem
- scientific article; zbMATH DE number 1003245
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Nonoblivious 2-opt heuristics for the traveling salesman problem
- Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
Cites Work
- Title not available (Why is that?)
- Optimization by simulated annealing
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Title not available (Why is that?)
- The traveling salesman. Computational solutions for RSP applications
- Record breaking optimization results using the ruin and recreate principle
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- The landscape of the traveling salesman problem
- Genetic Algorithms and the Optimal Allocation of Trials
- Stochastic Optimization
- Metaheuristic optimization via memory and evolution. Tabu search and scatter search.
- Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem
- Searching for Backbones—a high-performance parallel algorithm for solving combinatorial optimization problems
- Title not available (Why is that?)
- A computational study of smoothing heuristics for the traveling salesman problem
- Nonlinear optimization simplified by hypersurface deformation.
- On the approach to the equilibrium and the equilibrium properties of a glass-forming model
Cited In (10)
- Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods
- Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
- Continuous relaxations for the traveling salesman problem
- Pattern discrete and mixed hit-and-run for global optimization
- Dubins traveling salesman problem with neighborhoods: a graph-based approach
- On the theoretical properties of swap multimoves
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- Traveling salesman problem with clustering
- Variable neighbourhood structures for cycle location problems
- A note on single alternating cycle neighborhoods for the TSP
Uses Software
This page was built for publication: On the neighborhood structure of the traveling salesman problem generated by local search moves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468271)
