A non-revisiting simulated annealing algorithm [PDF]
In this article, a non-revisiting simulated annealing algorithm (NrSA) is proposed. NrSA is an integration of the non-revisiting scheme and standard simulated annealing (SA). It guarantees that every generated neighbor must not be visited before.
Chow, CK, Yuen, SY
core +3 more sources
Mathematical Aspects of the Digital Annealer’s Simulated Annealing Algorithm
The Digital Annealer is a CMOS hardware designed by Fujitsu Laboratories for high-speed solving of Quadratic Unconstrained Binary Optimization (QUBO) problems that could be difficult to solve by means of existing general-purpose computers. In this paper, we present a mathematical description of the first-generation Digital Annealer's Algorithm from the
Bruno Hideki Fukushima-Kimura +3 more
openaire +4 more sources
Quantum Algorithms for Simulated Annealing [PDF]
This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales with the inverse square root of the spectral gap of an associated stochastic matrix.
Boixo, Sergio, Somma, Rolando D.
openaire +2 more sources
An application of simulated annealing to the optimum design of reinforced concrete retaining structures [PDF]
This paper reports on the application of a simulated annealing algorithm to the minimum cost design of reinforced concrete retaining structures. Cantilever retaining walls are investigated, being representative of reinforced concrete retaining structures
Aarts +20 more
core +2 more sources
GA/SA-based hybrid techniques for the scheduling of generator maintenance in power systems [PDF]
YesProposes the application of a genetic algorithm (GA) and simulated annealing (SA) based hybrid approach for the scheduling of generator maintenance in power systems using an integer representation.
Burt, G.M. +3 more
core +1 more source
An adaptive simulated annealing algorithm
Inspired by the idea of the Metropolis algorithm, the authors propose a new sample adaptive simulated annealing algorithm on finite state space. The algorithm can be considered as a substitute of the annealing of iterative stochastic schemes in case of finite state space and can be hopefully extended to the denumerable state case with some ...
Gong, Guanglu, Liu, Yong, Qian, Minping
openaire +2 more sources
Simulated annealing with large-neighborhood search for two-echelon location routing problem
Considering the multi-level distribution network has becoming more and more common, a two-echelon location routing problem (2E-LRP) model was established based on minimum total cost objective function.
LI Xiang, LI Su-jian, LI Hong
doaj +1 more source
Optimization of Neural Network Training for Wine Quality Classification Using Simulated Annealing [PDF]
The backpropagation algorithm is the most used algorithm to train a neural network. However, a simulated annealing algorithm can do that work too.
Duan Mingfei
doaj +1 more source
Simulated Annealing for Topological Solitons [PDF]
The search for solutions of field theories allowing for topological solitons requires that we find the field configuration with the lowest energy in a given sector of topological charge.
A. Vilenkin +30 more
core +3 more sources
Open system quantum annealing in mean field models with exponential degeneracy [PDF]
Real life quantum computers are inevitably affected by intrinsic noise resulting in dissipative non-unitary dynamics realized by these devices. We consider an open system quantum annealing algorithm optimized for a realistic analog quantum device which ...
Kechedzhi, Kostyantyn +1 more
core +6 more sources

