Neighborhood Size in the Simulated Annealing Algorithm

DOI10.1080/01966324.1988.10737247zbMath0684.65060OpenAlexW2055078783WikidataQ58255638 ScholiaQ58255638MaRDI QIDQ4734688

Michael S. Waterman, Larry Goldstein

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

simulated annealing algorithmtravelling salesman problemprobabilistic algorithmneighborhood sizecombinatorially NP-hard problems

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Optimization by Simulated Annealing
• Mapping DNA by stochastic relaxation
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Computer Solutions of the Traveling Salesman Problem
• Generalized Feedback Shift Register Pseudorandom Number Algorithm
• Unnamed Item

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