Visiting near-optimal solutions using local search algorithms

DOI10.1007/978-3-7908-1709-6_38zbMath1437.62027OpenAlexW2279945465MaRDI QIDQ3298635

Laura A. McLay, Jacobson, Sheldon H., Shane N. Hall

Publication date: 15 July 2020

Published in: Compstat 2006 - Proceedings in Computational Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-7908-1709-6_38

zbMATH Keywords

local searchperformance analysis

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Editorial: 2nd special issue on applications of optimization heuristics to estimation and modelling problems

Uses Software

• TSPLIB
• LKH
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Performance analysis of cyclical simulated annealing algorithms
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• 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
• Global optimization performance measures for 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
• Finite-time performance analysis of static simulated annealing algorithms