Performance analysis of cyclical simulated annealing algorithms
From MaRDI portal
Publication:812974
Recommendations
- Analysis of static simulated annealing algorithms
- Finite-time performance analysis of static simulated annealing algorithms
- Analyzing the performance of local search algorithms using generalized hill climbing algorithms
- Cycle Decompositions and Simulated Annealing
- A class of convergent generalized hill climbing algorithms
Cites work
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3249566 (Why is no real title available?)
- A class of convergent generalized hill climbing algorithms
- A limit theorem for a class of inhomogeneous Markov processes
- A new simulated annealing algorithm
- A note on the finite time behavior of simulated annealing.
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Bounding the probability of success of stochastic methods for global optimization
- Convergence and finite-time behavior of simulated annealing
- Cooling Schedules for Optimal Annealing
- Finite-time performance analysis of static simulated annealing algorithms
- Global optimization performance measures for generalized hill climbing algorithms
- Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results
- On the convergence of generalized hill climbing algorithms
- Optimization by simulated annealing
- Parallel simulated annealing
- Selected topics in simulated annealing
- Simulated annealing for order spread minimization in sequencing cutting patterns
- Simulated annealing methods with general acceptance probabilities
- Some results characterizing the finite time behaviour of the simulated annealing algorithm.
- TSPLIB—A Traveling Salesman Problem Library
- The Theory and Practice of Simulated Annealing
- The exit path of a Markov chain with rare transitions
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
Cited in
(8)- Visiting near-optimal solutions using local search algorithms
- Analysis of static simulated annealing algorithms
- An analysis of neighborhood functions on generic solution spaces
- Finite-time performance analysis of static simulated annealing algorithms
- Meta-control of an interacting-particle algorithm for global optimization
- Adaptive predictions of the Euro/Złoty currency exchange rate using state space wavelet networks and forecast combinations
- Analyzing the performance of local search algorithms using generalized hill climbing algorithms
- Adaptive Prediction of Stock Exchange Indices by State Space Wavelet Networks
This page was built for publication: Performance analysis of cyclical simulated annealing algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812974)
