Dynamics of local search trajectory in traveling salesman problem
From MaRDI portal
Publication:2491325
DOI10.1007/s10732-005-3604-yzbMath1122.90402OpenAlexW1996670012MaRDI QIDQ2491325
Publication date: 29 May 2006
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027.42/45818
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Seeking global edges for traveling salesman problem in multi-start search, A multilevel tabu search algorithm for the feature selection problem in biomedical data
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chemical oscillations, waves, and turbulence
- Efficient simulated annealing on fractal energy landscapes
- Correlated and uncorrelated fitness landscapes and how to tell the difference
- Measuring the strangeness of strange attractors
- Structural analysis of local search heuristics in combinatorial optimization
- Local search and the local structure of NP-complete problems
- Estimating correlation dimension from a chaotic time series: When does plateau onset occur?
- A new adaptive multi-start technique for combinatorial global optimizations
- Distinguishing random and deterministic systems: Abridged version
- Combinatorial Landscapes
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- Independent coordinates for strange attractors from mutual information
- The statistical properties of dimension calculations using small data sets
- Evolutionary Walks on Rugged Landscapes
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Chaos
