The partitioning of random graphs is investigated numerically using “simulated annealing” and “extremal optimization …”. While generally in an NP-hard problem, it is shown that the optimization of the graph partitions is particularly difficult … “simulated annealing” is found to diverge in the thermodynamic limit. On the other hand, “extremal optimization”, a new general …

Simulated Annealing has become a standard optimization technique for a wide variety of problems: starting at a random …

Search space smoothing and related heuristic optimization algorithms provide an alternative approach to simulated … space smoothing intends to remove these barriers, so that a greedy algorithm is sufficient to find the global minimum … results achieved with heuristic optimization algorithms. We present computational results for the traveling salesman problem. …

By mapping the optimization problems to physical systems, the paper presents a general-purpose stochastic optimization …. As self-organized critical processes of extremal dynamics, the optimization dynamics successively updates the states of … those cities with high energy. Consequently, a near-optimal solution can be quickly obtained through the optimization …

Simulated annealing is the classic physical optimization algorithm, which has been applied to a large variety of …

We have developed continuous and discrete implementations of an optimization method (simulated annealing) to search the … continuous description allows to implement the algorithm in an easy way, but for the discrete one we had to determine priorities …

We discuss and illustrate a new stochastic algorithm (generalized simulated annealing) for computationally finding the … algorithm recovers, as particular cases, the so-called classical (“Boltzmann machine”) and fast (“Cauchy machine”) simulated …