Analysis of random restart and iterated improvement for global optimization with application to the traveling salesman problem
From MaRDI portal
Publication:1777596
DOI10.1007/s10957-004-0943-zzbMath1066.90091OpenAlexW1967756118MaRDI QIDQ1777596
Publication date: 24 May 2005
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-004-0943-z
Related Items
Cites Work
- Optimization by Simulated Annealing
- A probabilistic analysis of the switching algorithm for the Euclidean TSP
- Rough large deviation estimates for simulated annealing: Application to exponential schedules
- Parallel speed-up of Monte Carlo methods for global optimization
- Restarting search algorithms with applications to simulated annealing
- Bayesian stopping rules for multistart global optimization methods
- Cooling Schedules for Optimal Annealing
- New Results on the Old k-opt Algorithm for the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem