Simulated annealing methods with general acceptance probabilities
From MaRDI portal
Publication:3764964
DOI10.2307/3214097zbMath0628.60046OpenAlexW2013923357MaRDI QIDQ3764964
Awi Federgruen, Shoshana Anily
Publication date: 1987
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8a9cc7fccca2f82b1ad56ce02bb4b810eca38eb6
rate of convergenceglobal optimaconvergence of the algorithm to a global optimumsimulated annealing methods
Related Items (32)
Using simulated annealing to optimize the feature selection problem in marketing applications ⋮ On the convergence of stationary distributions in simulated annealing algorithms ⋮ A theoretical framework for simulated annealing ⋮ CONVERGENCE OF GENETIC EVOLUTION ALGORITHMS FOR OPTIMIZATION ⋮ Metaheuristics: A bibliography ⋮ A systematic procedure for setting parameters in simulated annealing algorithms ⋮ Annealing a genetic algorithm for constrained optimization ⋮ Sequential Monte Carlo simulated annealing ⋮ On the Ergodicity of Slow-Varying Nonstationary Markov Chains ⋮ Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data ⋮ The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem ⋮ Simulated annealing: A tool for operational research ⋮ A controlled search simulated annealing method for the single machine weighted tardiness problem ⋮ A note on the effect of neighborhood structure in simulated annealing ⋮ Simulated annealing with asymptotic convergence for nonlinear constrained optimization ⋮ Convergence of a modified algorithm of fast probabilistic modeling ⋮ Optimal design of LAN-WAN internetworks: An approach using simulated annealing ⋮ Simulated annealing: An introduction ⋮ Theory of genetic algorithms ⋮ Convergence of a random algorithm for function optimization ⋮ Some new results on simulated annealing applied to the job shop scheduling problem ⋮ Combinatorial optimization by stochastic automata ⋮ Optimizing simulated annealing schedules with genetic programming ⋮ Algorithms for the maximum satisfiability problem ⋮ Mean Convergence Time of Inhomogeneous Genetic Algorithm with Elitism ⋮ Convergence of Simulated Annealing with Feedback Temperature Schedules ⋮ On weak and strong ergodicity ⋮ Computational Experience with Generalized Simulated Annealing Over Continuous Variables ⋮ The influence of problem specific neighborhood structures in metaheuristics performance ⋮ Quantum annealing learning search for solving QUBO problems ⋮ On the convergence of generalized hill climbing algorithms ⋮ Performance analysis of cyclical simulated annealing algorithms
This page was built for publication: Simulated annealing methods with general acceptance probabilities