Solution Techniques

Deterministic Annealing

Deterministic Annealing operates in a way that is similar to SA, except that a deterministic rule is used for the acceptance of a move. Two standard implementations of this technique are threshold accepting [Dueck and Scheurer 1990] and record-to-record travel [Dueck 1993]. At iteration t of a threshold accepting algorithm, solution $x′$ is accepted if $f(x′) < f(x) + θ$ , where $θ$ is a user controlled parameter. In record-to-record travel a record is the best solution $x*$ encountered during the search. At iteration t, solution $x′$ is accepted if $f(x′) < θ f(x*)$ , where $θ$ is a user controlled parameter slightly larger than 1.