Cooling Schedules for Optimal Annealing
From MaRDI portal
Publication:3798159
DOI10.1287/moor.13.2.311zbMath0652.65050WikidataQ100356754 ScholiaQ100356754MaRDI QIDQ3798159
Publication date: 1988
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/df511a5d9d12bff681438e2dbe2ecef70268c9c9
convergence; simulated annealing; cooling schedule; randomized optimization; Monte-Carlo optimization
65K05: Numerical mathematical programming methods
65C05: Monte Carlo methods
90C15: Stochastic programming
60J27: Continuous-time Markov processes on discrete state spaces
Related Items
Estimation of non-stationary spectra by simulated annealing, A simulated annealing algorithm for system cost minimization subject to reliability constraints, Determining the number of kanbans and lotsizes in a generic kanban system: a simulated annealing approach, A Decision-Theoretic Approach to Summarising Posterior Information in a Sample of step Functions, Improved bounds for the large-time behaviour of simulated annealing, Convergence of a random algorithm for function optimization, Unnamed Item, Hnbue property in a shock model with cumulative damage threshold, ADAPTIVE AND MONOTONE SPLINE ESTIMATION OF THE CROSS-SECTIONAL TERM STRUCTURE, A note on the depth function of combinatorial optimization problems, An effective hybrid optimization strategy for job-shop scheduling problems, Theory of genetic algorithms, Adaptive memory programming: a unified view of metaheuristics, Fast parallel heuristics for the job shop scheduling problem, Some results characterizing the finite time behaviour of the simulated annealing algorithm., Faster Monte Carlo simulations at low temperatures. The waiting time method, A method of spatial reasoning based on qualitative trigonometry, Singular perturbed Markov chains and exact behaviors of simulated annealing processes, Optimal design of LAN-WAN internetworks: An approach using simulated annealing, The afforestation problem: A heuristic method based on simulated annealing, Simulated annealing applied to the process allocation problem, Global optimization requires global information, Asymptotic behavior of some linear differential systems, A simulated annealing heuristic for the one-dimensional cutting stock problem, General local search methods, Simulated annealing with time-dependent energy function via Sobolev inequalities, A feedback algorithm for determining search parameters for Monte Carlo optimization, On the problem of exit from cycles for simulated annealing processes. A backward equation approach, Piecewise constant triangular cooling schedules for generalized simulated annealing algorithms, Simulated annealing and the mapping problem: A computational study, Asymptotic behaviour of time-inhomogeneous evolutions on von Neumann algebras, Simulated annealing with time-dependent energy function, Best-so-far vs. where-you-are: Implications for optimal finite-time annealing, Simulated annealing for constrained global optimization, Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search, Simulated annealing and tabu search: Lessons from a line search, The depth and width of local minima in discrete solution spaces, On discrete inhomogeneous exit problems, Stochastic simulations of two-dimensional composite packings, On the invariant measure of non-reversible simulated annealing, The Metropolis algorithm for graph bisection, Improvement heuristics for the vehicle routing problem based on simulated annealing, Computing elastic moduli of two-dimensional random networks of rigid and nonrigid bonds by simulated annealing, A robust simulated annealing based examination timetabling system., Placement by thermodynamic simulated annealing, Solving the continuous flow-shop scheduling problem by metaheuristics., The loop erased exit path and the metastability of a biased vote process, Convergence of the simulated annealing algorithm for continuous global optimization, The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules, Markovian perturbations of discrete iterations: Lyapunov functions, global minimization, and associative memory, On the convergence of generalized hill climbing algorithms, ACO algorithms with guaranteed convergence to the optimal solution, The convergence of stochastic algorithms solving flow shop scheduling, Proposals for chunking and tabu search, Analysis of random restart and iterated improvement for global optimization with application to the traveling salesman problem, A theoretical study on the behavior of simulated annealing leading to a new cooling schedule, Solution quality of random search methods for discrete stochastic optimization, On the depth of combinatorial optimization problems, Two simulated annealing-based heuristics for the job shop scheduling problem, Some new results on simulated annealing applied to the job shop scheduling problem, Formulating and solving production planning problems, Solving the medium newspaper production/distribution problem, Analysis of static simulated annealing algorithms, A study of subadmissible simulated annealing algorithms, Global optimization with exploration/selection algorithms and simulated annealing, An improved simulated annealing simulation optimization method for discrete parameter stochastic systems, Adaptive temperature control for simulated annealing: a comparative study, Remarks on the ergodicity of simulated annealing algorithms on a graph, Metaheuristics: A bibliography, Limited communication control, On the classification of NP-complete problems in terms of their correlation coefficient, Simulated annealing algorithms for continuous global optimization: Convergence conditions, Integrating and accelerating tabu search, simulated annealing, and genetic algorithms, Multi-way graph partition by stochastic probe, A new genetic algorithm, Simulated annealing and object point processes: Tools for analysis of spatial patterns, Sufficient Conditions for Ergodicity and Convergence of MH, SA, and EM Algorithms, The demon algorithm, Parallel simulated annealing, Simulated annealing with extended neighbourhood
