Stochastic versus deterministic update in simulated annealing
References (16)
- et al.
Physica D
(1986) - et al.
Science
(1983) - et al.
SIAM Rev.
(1984) - et al.
J. Stat. Phys.
(1986) - et al.
Europhys. Lett.
(1987) - et al.
J. Chem. Phys.
(1953) - et al.
Phys. Rev. B
(1983) - et al.
Heidelberg Colloquium on Glassy dynamics
Cited by (72)
Stochastic reconstruction of fracture network pattern using spatial point processes
2024, Geoenergy Science and EngineeringA landscape-based analysis of fixed temperature and simulated annealing
2023, European Journal of Operational ResearchCitation Excerpt :They conjecture that no monotone decreasing temperature sequence is optimal for a broader set of cases. They also consider a (deterministic) threshold random search, prove that there is an optimal sequence of threshold values, and state that probably in many situations there is an optimal deterministic threshold sequence that outperforms any random threshold sequence; incidentally, this can be considered the first study of deterministic variants of SA, later also called Threshold Acceptance (Dueck & Scheuer, 1990; Moscato & Fontanari, 1990). However, they add that “the practical implication of these likelihoods is clouded, since it is unclear how to efficiently find an optimal temperature sequence or deterministic threshold sequence for a problem instance” (Hajek & Sasaki, 1989), and thus SA is probably a good fallback solution.
A new hybrid SSA-TA: Salp Swarm Algorithm with threshold accepting for band selection in hyperspectral images
2020, Applied Soft ComputingRevisiting simulated annealing: A component-based analysis
2019, Computers and Operations ResearchCitation Excerpt :For example, keeping the same temperature value throughout the whole execution turns SA into an algorithm known under several names, such as Metropolis Algorithm (Jerrum, 1992), Generalized Hill Climbing (Johnson and Jacobson, 2002), Static Simulated Annealing (Orosz and Jacobson, 2002), or simply fixed temperature schemes (Cohn and Fielding, 1999; Fielding, 2000). Replacing the probabilistic acceptance criterion with a deterministic one, it is possible to generate a new class of local search algorithms, such as the Threshold Acceptance (Dueck and Scheuer, 1990; Moscato and Fontanari, 1990), Great Deluge Algorithm and Record-to-Record Travel (Dueck, 1993), or the more recent Late Acceptance Hill Climbing (Burke and Bykov, 2012; 2017). All these variants are described in the next section.
Pumped-storage project: A short to long term investment analysis including climate change
2015, Renewable and Sustainable Energy ReviewsPerturbation-Based Thresholding Search for Packing Equal Circles and Spheres
2023, INFORMS Journal on Computing
- 1
Present address: Instituto de Fisica e Química de São Carlos, Universidade de São Paulo, 13560 São Carlos, SP, Brazil.