Visiting near-optimal solutions using local search algorithms

DOI10.1007/978-3-7908-1709-6_38MaRDI QIDQ3298635zbMATH OpenOpenAlexFDO

Authors Sheldon H. Jacobson, Laura A. Mclay, 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) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A framework for analyzing sub-optimal performance of local search algorithms
• Using Markov chains to analyze the effectiveness of local search algorithms
• Mechanisms for local search
• scientific article; zbMATH DE number 1054958
• Local search: complexity and approximation

Cites work

• A class of convergent generalized hill climbing algorithms
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Finite-time performance analysis of static simulated annealing algorithms
• Global optimization performance measures for generalized hill climbing algorithms
• scientific article; zbMATH DE number 3898613 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• On the convergence of generalized hill climbing algorithms
• Performance analysis of cyclical simulated annealing algorithms
• The Theory and Practice of Simulated Annealing
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(10)

• Editorial: 2nd special issue on applications of optimization heuristics to estimation and modelling problems
• The life span method -- a new variant of local search
• Local search with annealing-like restarts to solve the VRPTW
• An experimental analysis of local minima to improve neighbourhood search.
• Finding robust solutions using local search
• Exploiting relaxation in local search for LABS
• Subthreshold-seeking local search
• Using Markov chains to analyze the effectiveness of local search algorithms
• scientific article; zbMATH DE number 1488096 (Why is no real title available?)
• A framework for analyzing sub-optimal performance of local search algorithms

Describes a project that uses

Uses Software

• TSPLIB
• LKH
• Tabu search

This page was built for publication: Visiting near-optimal solutions using local search algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3298635)