Efficient simulated annealing on fractal energy landscapes

DOI10.1007/BF01759051zbMath0728.90073OpenAlexW2073850430MaRDI QIDQ805499

Gregory B. Sorkin

Publication date: 1991

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01759051

zbMATH Keywords

simulated annealingfractal landscapesrandom walk on a graphrapidly-mixing Markov chains

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search, A new adaptive multi-start technique for combinatorial global optimizations, A theoretical framework for simulated annealing, Stochastic simulations of two-dimensional composite packings, Metaheuristics: A bibliography, The Metropolis algorithm for graph bisection, Computing elastic moduli of two-dimensional random networks of rigid and nonrigid bonds by simulated annealing, Simulated annealing for Lévy-driven jump-diffusions, A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation, A note on edge-based graph partitioning and its linear algebraic structure, Analysis and guidelines to obtain a good uniform fuzzy partition granularity for fuzzy rule-based systems using simulated annealing, Searching oligo sets of human chromosome 12 using evolutionary strategies, Dynamics of local search trajectory in traveling salesman problem, Two simulated annealing-based heuristics for the job shop scheduling problem, Mechanisms for local search, A new genetic algorithm, Best-so-far vs. where-you-are: Implications for optimal finite-time annealing, Objective function features providing barriers to rapid global optimization

Uses Software

• TimberWolf

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Geometric bounds for eigenvalues of Markov chains
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Configuration Space Analysis for Optimization Problems
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Convergence of an annealing algorithm
• Convergence and finite-time behavior of simulated annealing
• Cooling Schedules for Optimal Annealing