An algorithm based on simulated annealing that in one turn computes the set of rules together with their priority levels is proposed.
This independent validation of the design is based on simulated annealing and restrained molecular dynamics simulation in vacuo, comparable to procedures used to refine NMR and X-ray structures.
We recall that modularity was introduced by Newman in [25, 26] and, since then, several methods for its maximization have been proposed, like the one by Guimerà and Amaral based on simulated annealing [27], the extremal optimization method by Duch and Arenas [28], the fast greedy algorithm by Blondel et al. [23], or the multilevel algorithm by Noack and Rotta [29].
In [31], the maximization is based on simulated annealing, it must run at one single resolution each time, and its computational complexity is very high.
A stochastic optimisation technique based on simulated annealing is employed to obtain optimal solutions.
An optimization method based on simulated annealing algorithm (SAA) was proposed.
Based on simulated annealing, we introduce a damping scheme for the randomized approach.
Robust optimization algorithms based on simulated annealing [13] or on Unscented Kalman Filtering [44] have been proposed.
In this work we design a metaheuristic approach based on simulated annealing to solve the PE-CTT.
Moreover, to intensify the search more and more, a powerful local search mechanism based on simulated annealing is developed.
