Although, the Simulated Annealing
Method is one of various local search methods using a perturbation of the model parameters, the Simulated Annealing
Method works as a global search method at high temperature, because it allows an incremental change on the misfit surface.
Removal of conflicting labels: If the solution computed by simulated annealing
contains label pairs in severe conflict (which would be unacceptable), severe overlap between label pairs is resolved at this junction by simply removing some of the labels.
Keywords: evolutionary computation, simulated annealing
, thermodynamics of equilibrium, detailed balance, ergodicity.
Improved global-local simulated annealing
formulation for solving non-smooth engineering optimization problems, International Journal of Solids and Structures 42(1): 203-237.
Tabu Search (TS) is similar to Simulated Annealing
in that both traverse the solution space by testing mutations of an individual solution.
Moreover, the simulated annealing
approach (SA/PS) of also generated an inferior solution of 17.
Tabu Search is similar to Simulated Annealing
in that both traverse the solution space by testing mutations of an individual solution was proposed by Glover .
Chou et al,  has proposed simulated annealing
based parameter determination and feature selection for the support vector machine (SVM) classifier and also in the same year they have proposed to set the learning rate, number of hidden neurons and momentum along with feature subset selection for the back propagation networks [Lin et al.
2012), we use the hybrid simulated annealing
method proposed by this study as the fourth benchmark method (values of simulated annealing
parameters used in our experiments are reported in table 1 above; see Xiao et al.
Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing
In this research, an Simulated Annealing
(SA) algorithm is proposed for designing the bus route to maximize the quantity of passengers who can be serviced by buses within the same travel time limit.
Therefore, classical metaheuristics (searching with tabu, simulated annealing
, genetic algorithm), which are very successful in solving many classical problems of tasks scheduling (mainly with a criterion [C.