We introduce four new general optimization algorithms based on thèdemon' algorithm from statistical physics and the simulated annealing (SA) optimization method. These algorithms use a computationally simpler acceptance function, but can use any SA annealing schedule or move generation function. Computation per trial is signiicantly reduced. The algorithms are tested on traveling salesman probl...

Parallel Tempering (PT) is an effective algorithm to overcome the slow convergence in low-temperature protein simulation by initiating multiple systems to run at multiple temperature levels and randomly switch with neighbor temperature levels. We implemented the PT scheme in the Rosetta to explore the rough energy landscape in protein folding and to improve the success rate of Rosetta in topolo...

In this paper a simulated annealing (SA) algorithm is presented for the 0/1 multidimensional knapsack problem. Problem-specific knowledge is incorporated in the algorithm description and evaluation of parameters in order to look into the performance of finite-time implementations of SA. Computational results show that SA performs much better than a genetic algorithm in terms of solution time, w...

A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report results of computational experiments with a set of test functions and we compare to methods of similar structure. The accompanying software accepts objective functions coded both in Fortran 77 and C++.

For the optimal size and placement of the dynamic voltage restorer (DVR) in a distribution network, in this paper the Simulated Annealing (SA) method is proposed. The multi-objective problem is converted to a single function using the goal attainment method. The obtained results show the voltage sag improvement on sensitive load nodes and other nodes in distribution system with minimum cost.

In this thesis we examine the performance of simulated annealing (SA) on various response surfaces. The main goals of the study are to evaluate the effectiveness of SA for stochastic optimization, develop modifications to SA in an attempt to improve its performance, and to evaluate whether artificially adding noise to a deterministic response surface might improve the performance of SA. SA is a...

Simulated annealing (SA) is applied for three-dimensional (3D) equilibrium calculation of ideal, low-beta reduced MHD in cylindrical geometry. The SA is based on the theory of Hamiltonian mechanics. The dynamical equation of the original system, low-beta reduced MHD in this study, is modified so that the energy changes monotonically while preserving the Casimir invariants in the artificial dyna...

− In this paper, we propose a Simulated Annealing PolyClonal Selection Algorithm (SAPCSA) for Traveling Salesman Problems (TSP). By introducing a simulated annealing (SA) strategy to the PolyClonal Selection Algorithm (PCSA), the SAPCSA integrate the characteristics of both SA and PCSA. Numerous instances have been simulated to verify the proposed algorithm.

The electronic structure of DNA is determined by its nucleotide sequence, which is for instance exploited in molecular electronics. Here we demonstrate that also the DNA strand breakage induced by low-energy electrons (18 eV) depends on the nucleotide sequence. To determine the absolute cross sections for electron induced single strand breaks in specific 13 mer oligonucleotides we used atomic f...