Simulated Annealing with Deterministic Decisions
نویسندگان
چکیده
منابع مشابه
Simulated Annealing with Deterministic Decisions
Problem statement: Simulated Annealing (SA) algorithms have been used in solving a wide range of discrete optimization problems for many years, with well know drawbacks like the computational time and difficulties related to the parameters settings. One of the other issues that open the door for research is the acceptance decision that provides for hill climbing; the standard SA algorithms use ...
متن کاملDeterministic and Simulated Annealing Approach to Fuzzy C-means Clustering
This paper explains the approximation of a membership function obtained by entropy regularization of the fuzzy c-means (FCM) method. By regularizing FCM with fuzzy entropy, a membership function similar to the Fermi-Dirac distribution function is obtained. We propose a new clustering method, in which the minimum of the Helmholtz free energy for FCM is searched by deterministic annealing (DA), w...
متن کاملRobust optimization with simulated annealing
Complex systems can be optimized to improve the performance with respect to desired functionalities. An optimized solution, however, can become suboptimal or even infeasible, when errors in implementation or input data are encountered. We report on a robust simulated annealing algorithm that does not require any knowledge of the problems structure. This is necessary in many engineering applicat...
متن کاملDistributed Simulated Annealing with MapReduce
Simulated annealing’s high computational intensity has stimulated researchers to experiment with various parallel and distributed simulated annealing algorithms for shared memory, message-passing, and hybrid-parallel platforms. MapReduce is an emerging distributed computing framework for large-scale data processing on clusters of commodity servers; to our knowledge, MapReduce has not been used ...
متن کاملA Mushy State Simulated Annealing
It is a long time that the Simulated Annealing (SA) procedure has been introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2009
ISSN: 1549-3636
DOI: 10.3844/jcssp.2009.974.979