The implementation of the SA algorithm is remarkably easy. Figure 17 shows its basic structure. The following elements must be provided:

- a representation of possible solutions,
- a generator of random changes in solutions,
- a means of evaluating the problem functions, and
- an
*annealing schedule*- an initial temperature and rules for lowering it as the search progresses.

Figure 17: The Structure of the Simulated Annealing Algorithm.

- 4.1.1 Solution Representation and Generation
- 4.1.2 Solution Evaluation
- 4.1.3 Annealing Schedule
- 4.1.4 SA Computational Considerations
- 4.1.5 SA Algorithm Performance