Results

**1 - 1**of**1**### 1.2 Distinct SA approaches

, 1061

"... Given a combinatorial optimization problem specified by a finite set of configurations or states S and by a cost function C defined on all the states j in S, the SA algorithm is characterized by a rule to generate randomly a new configuration with a certain probability, and by a random acceptance ru ..."

Abstract
- Add to MetaCart

Given a combinatorial optimization problem specified by a finite set of configurations or states S and by a cost function C defined on all the states j in S, the SA algorithm is characterized by a rule to generate randomly a new configuration with a certain probability, and by a random acceptance rule according to which the new configuration is accepted or rejected. A parameter T controls the acceptance rule. The generic structure of the algorithm is presented in Fig.1. Theoretical investigations of the SA optimization technique have been reported in some literatures [8].