Simulated annealing: An introduction
From MaRDI portal
Publication:3832323
DOI10.1111/j.1467-9574.1989.tb01245.xzbMath0676.90058OpenAlexW2106924148MaRDI QIDQ3832323
Emile H. L. Aarts, Peter J. M. Van Laarhoven
Publication date: 1989
Published in: Statistica Neerlandica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1467-9574.1989.tb01245.x
Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27)
Related Items (12)
Simulated annealing for constrained global optimization ⋮ Theory of genetic algorithms. II: Models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling ⋮ An algorithm for constructing optimal resolvable incomplete block designs ⋮ A nested simulated annealing algorithm ⋮ Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths ⋮ An analytically derived cooling schedule for simulated annealing ⋮ Theory of genetic algorithms ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ The computation of average run length and average time to signal: an overview ⋮ Linear analysis of genetic algorithms ⋮ Computing the minimum covariance determinant estimator (MCD) by simulated annealing ⋮ Simulated annealing for data modeling in scientific images
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Using tabu search techniques for graph coloring
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach
- On the depth of combinatorial optimization problems
- Non-negative matrices and Markov chains.
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- 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
- Using simulated annealing to solve routing and location problems
- Convergence and finite-time behavior of simulated annealing
- Simulated annealing methods with general acceptance probabilities
- Job Shop Scheduling by Simulated Annealing
- Computer Solutions of the Traveling Salesman Problem
This page was built for publication: Simulated annealing: An introduction
