Analysis of random restart and iterated improvement for global optimization with application to the traveling salesman problem

DOI10.1007/s10957-004-0943-zzbMath1066.90091OpenAlexW1967756118MaRDI QIDQ1777596

Niranjan Chakravarthy

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

zbMATH Keywords

global optimizationtraveling salesman problemiterated improvementRandom restart

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Related Items

General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic

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