A framework for analyzing sub-optimal performance of local search algorithms

DOI10.1007/S10589-009-9290-1zbMath1222.90035OpenAlexW1969481946MaRDI QIDQ548682

Shane N. Hall, Alexander G. Nikolaev, Darrall Henderson, Jacobson, Sheldon H.

Publication date: 30 June 2011

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-009-9290-1

zbMATH Keywords

convergencesimulated annealingtabu searchtravelling salesman problemfinite-time performanceLin-Kernighan-Helsgaun algorithm

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• TSPLIB
• LKH
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using Markov chains to analyze the effectiveness of local search algorithms
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• An empirical study of a new metaheuristic for the traveling salesman problem
• Tabu search performance on the symmetric travelling salesman problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• On the convergence of generalized hill climbing algorithms
• A class of convergent generalized hill climbing algorithms
• TSPLIB—A Traveling Salesman Problem Library
• The Theory and Practice of Simulated Annealing
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Handbook of metaheuristics
• Finite-time performance analysis of static simulated annealing algorithms

This page was built for publication: A framework for analyzing sub-optimal performance of local search algorithms