Performance analysis of cyclical simulated annealing algorithms
From MaRDI portal
Publication:812974
DOI10.1007/S11009-005-1482-2zbMATH Open1081.90068OpenAlexW2046916159MaRDI QIDQ812974FDOQ812974
Authors: Shane N. Hall, Laura A. Mclay, Jeffrey E. Orosz, Sheldon H. Jacobson 
Publication date: 30 January 2006
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-005-1482-2
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
- TSPLIB—A Traveling Salesman Problem Library
- Optimization by simulated annealing
- Title not available (Why is that?)
- The exit path of a Markov chain with rare transitions
- Title not available (Why is that?)
- Cooling Schedules for Optimal Annealing
- Title not available (Why is that?)
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- The Theory and Practice of Simulated Annealing
- A note on the finite time behavior of simulated annealing.
- On the convergence of generalized hill climbing algorithms
- A class of convergent generalized hill climbing algorithms
- Convergence and finite-time behavior of simulated annealing
- Finite-time performance analysis of static simulated annealing algorithms
- Selected topics in simulated annealing
- A limit theorem for a class of inhomogeneous Markov processes
- Simulated annealing methods with general acceptance probabilities
- Simulated annealing for order spread minimization in sequencing cutting patterns
- Global optimization performance measures for generalized hill climbing algorithms
- Parallel simulated annealing
- Bounding the probability of success of stochastic methods for global optimization
- Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results
- A new simulated annealing algorithm
- Some results characterizing the finite time behaviour of the simulated annealing algorithm.
Cited In (8)
- 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
- Visiting near-optimal solutions using local search algorithms
Uses Software
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)
