𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal ensemble size for parallel implementations of simulated annealing

✍ Scribed by Karl Heinz Hoffmann; Paolo Sibani; Jacob M. Pedersen; Peter Salamon

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
324 KB
Volume
3
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

We determine the optimal ensemble size for a simulated annealing problem based on assumptions about scaling properties of the system dynamics and of the density of states in the low energy regime. The derivations indicate the optimal annealing time for any one ensemble member, thereby providing a stopping criterion and an explanation for the "brick wall effect".

πŸ“œ SIMILAR VOLUMES

Parallel simulated annealing for structu
Parallel simulated annealing for structural optimization
✍ J.P.B. Leite; B.H.V. Topping πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 391 KB

The simulated annealing (SA) algorithm has proven to be a good technique for solving dicult combinatorial optimization problems. In engineering optimization the SA has emerged as an alternative tool to solve problems which are dicult to solve by conventional mathematical programming techniques. The

Implementation of Ensemble-Based Simulat
Implementation of Ensemble-Based Simulated Annealing with dynamic load balancing under MPI
✍ AndrΓ© Fachat; Karl Heinz Hoffmann πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 620 KB

This paper describes an im[,lementation of Ensemble Based Simulated Annealing (EBSA) with dynamic load balancing. It is running under the MP! Message Passing Library allowing parallel execution on various types of computers. The load balancing is used to get maximum use of the available processing p

Optimization of job scheduling on parall
Optimization of job scheduling on parallel machines by simulated annealing algorithms
✍ Zhen-Ping Lo; B. Bavarian πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 536 KB

ln this paper, we consider the problem of scheduling a set of simultaneously available jobs on several parallel machines. Specifically, the minimization of the time to finish all the jobs assigned to all machines under job deadline constraints for n jobs, m machines problem is formulated in this pap

Scalar and Parallel Optimized Implementa
Scalar and Parallel Optimized Implementation of the Direct Simulation Monte Carlo Method
✍ Stefan Dietrich; Iain D. Boyd πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 500 KB

collisions of particles with a solid surface; (3) determine the cell location of each particle; (4) on a statistical basis, This paper describes a new concept for the implementation of the direct simulation Monte Carlo (DSMC) method. It uses a localized compute collisions between particles occupying