Multiobjective Simulated Annealing: Principles and Algorithm Variants

Abstract EN

Simulated annealing is a stochastic local search method, initially introduced for global combinatorial mono-objective optimisation problems, allowing gradual convergence to a near-optimal solution.

An extended version for multiobjective optimisation has been introduced to allow a construction of near-Pareto optimal solutions by means of an archive that catches nondominated solutions while exploring the feasible domain.

Although simulated annealing provides a balance between the exploration and the exploitation, multiobjective optimisation problems require a special design to achieve this balance due to many factors including the number of objective functions.

Accordingly, many variants of multiobjective simulated annealing have been introduced in the literature.

This paper reviews the state of the art of simulated annealing algorithm with a focus upon multiobjective optimisation field.