Filters








12,480 Hits in 2.6 sec

Random restarting versus simulated annealing

B.L. Fox
1994 Computers and Mathematics with Applications  
We show by example that, when direct self-loops are eliminated, explicitly or implicitly, from simulated annealing that random restarting does not beat simulated annealing in the sense of an assertion  ...  However, simulated annealing can be implemented so that no moves are explicity rejected; in that case, an example below shows that the assertion above does not hold when N counts only accepted moves.  ...  A necessary condition for the truth of this assertion about the relative (large) finite-time performance of random restarting and simulated annealing is that all moves, accepted and rejected, are counted  ... 
doi:10.1016/0898-1221(94)90108-2 fatcat:lvm7s7miovho7l4w4pdtf26yvi

Best Practices for Simulated Annealing in Multiprocessor Task Distribution Problems [chapter]

Heikki Orsila, Erno Salminen, Timo D.
2008 Simulated Annealing  
Simulated annealing Simulated Annealing is a probabilistic non-greedy algorithm (Kirkpatrick et al., 1983 ) that explores the search space of a problem by annealing from a high to a low temperature.  ...  Simulated Annealing algorithm produces a "Monte Carlo -like" effect at very high temperatures as almost all worsening moves are accepted.  ...  We encourage readers to explore the application of Simulated Annealing in their work for the task of optimization.  ... 
doi:10.5772/5559 fatcat:bhtzkh4evbh7pkqwf2dpyucbhi

Relaxing synchronization in distributed simulated annealing

Chul-Eui Hong, B.M. McMillin
1995 IEEE Transactions on Parallel and Distributed Systems  
This paper presents a cost error measurement scheme and relaxed synchronization method, for simulated annealing on a distributed memory multicomputer, which predicts the amount of cost error that an algorithm  ...  Since simulated annealing randomly selects hill climbing moves, it can tolerate some cost errors.  ...  When the new cost is larger than the current cost, i.e., AC > 0, this proposed move is called a hill climbing move in simulated annealing.  ... 
doi:10.1109/71.342132 fatcat:d42w6wkzgbbcppqfcn6edqlcoy

Parallel two-level simulated annealing

Guo-Liang Xue
1993 Proceedings of the 7th international conference on Supercomputing - ICS '93  
This two-level simulated annealing algorithm is less likely to get stuck at a non-global minimizer than conventional simulated annealing algorithms.  ...  In this paper, we propose a new kind of simulated annealing algorithm called t we-level stnaulat ed annealing for sblving certain class of hard combinatorial optimization problems.  ...  There, they present the temperature is low, this move will be rejected.  ... 
doi:10.1145/165939.166011 dblp:conf/ics/Xue93 fatcat:6clzqihkkrgzpg2okqdtvtxjqe

Galilean and Hamiltonian Monte Carlo

John Skilling
2019 Proceedings (MDPI)  
Nested sampling (for which GMC was originally designed) has similar dominance over simulated annealing, which loses power by imposing an unnecessary thermal blurring over energy.  ...  Figure 9 . 9 Simulated annealing without (left) and with (right) phase change.  ...  The other part of a successful algorithm concerns how to move location without decreasing the quality attained so far.  ... 
doi:10.3390/proceedings2019033019 fatcat:zfvs6qx6vza3tgpe5g4lw5gec4

Improved simulated annealing algorithm for PAPR reduction in OFDM systems

S. K. Ting, C. E. Tan, Rohana Sapawi
2006 2006 International Conference on Computing & Informatics  
This paper has investigated the possibility of adopting an improved version of simulated annealing to achieve a more efficient PAPR reduction in OFDM systems.  ...  annealing could also produce promising results and possibly with lower computational complexity.  ...  THE IMPROVED AND OPTIMISED PARAMETERS FOR SIMULATED ANNEALING The elements of simulated annealing that can be further developed and optimised are the population size, the move class, the annealing schedule  ... 
doi:10.1109/icoci.2006.5276574 fatcat:tcgir5s2sfga5bgmvbgw4qkk6i

Parameterizing Simulated Annealing for Distributing Task Graphs on Multiprocessor SoCs

Heikki Orsila, Tero Kangas, Erno Salminen, Timo Hamalainen
2006 2006 International Symposium on System-on-Chip  
Simulated annealing is a versatile algorithm for hard optimization problems, such as task distribution on MPSoCs.  ...  The method determines a proper annealing schedule and transition probabilities for simulated annealing, which makes the algorithm scalable with respect to application and platform size.  ...  The algorithm terminates when the final temperature is reached and sufficient number of consecutive moves have been rejected.  ... 
doi:10.1109/issoc.2006.321971 dblp:conf/issoc/OrsilaKSH06 fatcat:tl3hvga5qvdkbl33vcgqc25cw4

Label Number Maximization in the Slider Model [chapter]

Dietmar Ebner, Gunnar W. Klau, René Weiskircher
2005 Lecture Notes in Computer Science  
The purpose of this paper is twofold: We present a new force-based simulated annealing algorithm to heuristically solve the problem and we provide the results of a very thorough experimental comparison  ...  Our experimental results show that the new algorithm outperforms the other methods in terms of quality while still being reasonably fast and confirm that the simulated annealing method is well-suited for  ...  The general simulated annealing procedure applies a series of sequential moves while simultaneously decreasing the temperature.  ... 
doi:10.1007/978-3-540-31843-9_16 fatcat:ofk6iphaubdhheistphexjshbi

Parallel algorithms for FPGA placement

Malay Haldar, Anshuman Nayak, Alok Choudhary, Prith Banerjee
2000 Proceedings of the 10th Great Lakes Symposium on VLSI - GLSVLSI '00  
Simulated annealing has been the method of choice for placement. However, simulated annealing is a very compute-intensive method.  ...  In our present work we investigate a range of parallelization strategies to speedup simulated annealing with application to placement ]or FPGA.  ...  If we consider simulated annealing as a search path where moves are proposed and either accepted or rejected depending on a particular cost evaluation and a random seed.  ... 
doi:10.1145/330855.330988 dblp:conf/glvlsi/HaldarNCB00 fatcat:ghg66d252vagdg42kloglzfrsy

Efficient and Deterministic Parallel Placement for FPGAs

Adrian Ludwin, Vaughn Betz
2011 ACM Transactions on Design Automation of Electronic Systems  
We describe a parallel simulated annealing algorithm for FPGA placement.  ...  The algorithm proposes and evaluates multiple moves in parallel, and has been incorporated into Altera's Quartus II CAD system.  ...  Parallelizing Simulated Annealing Moves The most popular approach to parallelizing simulated annealing has been to parallelize the execution of individual moves.  ... 
doi:10.1145/1970353.1970355 fatcat:3nbivkbf6ffpdpmu4ghbuaqqda

Neural Network Structure Optimization by Simulated Annealing

Chun Lin Kuo, Ercan Engin Kuruoglu, Wai Kin Victor Chan
2022 Entropy  
The structure optimization is performed using the simulated annealing algorithm only, without utilizing back-propagation for branch weight training.  ...  Our simulation results have shown that simulated annealing can significantly reduce the complexity of a fully connected network while maintaining the performance without the help of back-propagation.  ...  These moves are not done in a deterministic manner but instead via a stochastic heuristic algorithm, namel,y simulated annealing.  ... 
doi:10.3390/e24030348 pmid:35327859 pmcid:PMC8947290 fatcat:me2ooul5abeibc2gocf5rosovm

Process optimization via simulated annealing: Application to network design

W. B. Dolan, P. T. Cummings, M. D. LeVan
1989 AIChE Journal  
When applied to a problem of cost minimization, moves are accepted and rejected based on a cost function. No heuristic arguments are needed.  ...  In this paper, simulated annealing is introduced and reviewed.  ...  Simulated annealing is based on the theory of Markov chains, as described below. It accepts and rejects randomly generated 'moves' on the basis of a probability related to an 'annealing temperature'.  ... 
doi:10.1002/aic.690350504 fatcat:2asr5xzuwzb4nelehv4towfodq

Optimal Sampling for Simulated Annealing Under Noise

Robin C. Ball, Juergen Branke, Stephan Meisel
2018 INFORMS journal on computing  
An empirical evaluation shows that the resulting approach is indeed more efficient than several previously proposed Simulated Annealing variants.  ...  This paper proposes a Simulated Annealing variant for optimization problems in which the solution quality can only be estimated by sampling from a random distribution.  ...  step at n = N beyond which the move is rejected without further consideration.  ... 
doi:10.1287/ijoc.2017.0774 fatcat:vdonp6qecrcsdb7bniaxc6w5jq

A simulated annealing approach to mine production scheduling

M Kumral, P A Dowd
2005 Journal of the Operational Research Society  
Therefore, the selection of the ratio of the numbers of rejected moves to accepted moves is important.  ...  If the ratio of rejected moves to accepted moves is greater than A, the system heats up and vice versa.  ... 
doi:10.1057/palgrave.jors.2601902 fatcat:zsvalpqz4zckvkhyhn7bcah73m

A Review on Hill Climbing Optimization Methodology

2022 Recent trends in Management and Commerce  
In free climbing, the climber moves the wall under their own force without the use of any special gear (except for the climbing shoes) to help them move upwards.  ...  There is no special processing data system as mountaineering rejects old nodes.  ...  This is a simulated annealing technique.  ... 
doi:10.46632/rmc/3/1/1 fatcat:66s3wckfknfgdiouk5vhiyyvbe
« Previous Showing results 1 — 15 out of 12,480 results