Neighborhood Size in the Simulated Annealing Algorithm

DOI10.1080/01966324.1988.10737247MaRDI QIDQ4734688zbMATH OpenOpenAlexWikidataFDO

Authors Larry Goldstein, Michael S. Waterman

Publication date 1988

Published in American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01966324.1988.10737247

zbMATH Keywords

combinatorially NP-hard problemsneighborhood sizeprobabilistic algorithmsimulated annealing algorithmtravelling salesman problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• Computer Solutions of the Traveling Salesman Problem
• Generalized Feedback Shift Register Pseudorandom Number Algorithm
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Mapping DNA by stochastic relaxation
• Optimization by simulated annealing
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images

Cited in

(2)

• A feedback algorithm for determining search parameters for Monte Carlo optimization
• Heuristics for search sequencing under time-dependent probabilities of existence

This page was built for publication: Neighborhood Size in the Simulated Annealing Algorithm

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