Multi-Objective Simulated Annealing (MOSA)
Multi-Objective Simulated Annealing · Also known as: MOSA, Multi-Criteria Simulated Annealing, Pareto Simulated Annealing, PSA
Multi-Objective Simulated Annealing (MOSA) extends the classical simulated annealing metaheuristic to problems with two or more conflicting objective functions. Instead of converging to a single optimum, MOSA explores the solution space stochastically and maintains an archive of non-dominated (Pareto-optimal) solutions, offering decision-makers a diverse trade-off front rather than one prescribed answer.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use MOSA when you face an optimization problem with two or more conflicting objectives and either continuous or combinatorial decision variables, particularly when the objective landscape is non-convex, multimodal, or gradient-free. It is well-suited to scheduling, routing, engineering design, and resource allocation problems where an explicit trade-off front is more useful than a single weighted aggregate. Prefer MOSA over purely stochastic Monte Carlo when you need optimization rather than uncertainty quantification. Do NOT use MOSA when the problem has a single objective (classical SA suffices), when the Pareto front must be found exactly (exact algorithms are better for small problems), when the number of objectives exceeds roughly five (hypervolume-based methods scale better), or when evaluation of objectives is extremely expensive per call (surrogate-based methods are preferable).
Strengths & limitations
- Requires no gradient information and handles non-convex, discontinuous, and multimodal objective landscapes.
- Probabilistic acceptance of inferior solutions allows escape from local Pareto fronts that trap purely greedy approaches.
- Produces a diverse approximation of the full Pareto front in a single run, giving decision-makers explicit trade-off options.
- Implementation is straightforward and the cooling schedule provides an intuitive parameter to tune exploration–exploitation balance.
- Applicable to both continuous and combinatorial optimization problems with minimal reformulation.
- Solution quality and Pareto front coverage are sensitive to the choice of initial temperature, cooling rate, and neighborhood operator, requiring problem-specific tuning.
- Convergence to a high-quality Pareto front can require many objective evaluations, making it slow for expensive black-box simulations.
- Maintaining and updating the Pareto archive introduces overhead and the archive may grow large, increasing memory and comparison costs.
- Unlike population-based methods (e.g., NSGA-II), the single-trajectory nature of basic MOSA can produce uneven coverage of the Pareto front.
- Theoretical convergence guarantees require an infinitely slow cooling schedule, which is impractical; finite schedules sacrifice optimality assurance.
Frequently asked
How does MOSA differ from NSGA-II?
NSGA-II is a population-based evolutionary algorithm that evolves a set of solutions simultaneously using crossover, mutation, and non-dominated sorting. MOSA is a trajectory-based method that explores one solution at a time using probabilistic moves. MOSA tends to be simpler to implement and works well for combinatorial problems, while NSGA-II generally provides better Pareto front coverage for continuous problems and scales more predictably.
How should I set the initial temperature T_0?
A common heuristic is to run a short preliminary phase and choose T_0 so that approximately 80% of random neighbor moves are accepted. This ensures broad exploration at the start. Problem-specific calibration is advisable because the appropriate temperature scale depends on the magnitude of objective function differences.
Can MOSA handle more than two objectives?
Yes, but performance degrades as the number of objectives grows. The Pareto archive management cost increases, and the fraction of non-dominated solutions grows rapidly, making the acceptance criterion less discriminating. For problems with more than four or five objectives, hypervolume-indicator-based or decomposition-based methods (e.g., MOEA/D) are generally preferred.
How do I know when to stop the algorithm?
Common stopping criteria include reaching a minimum temperature, exhausting a maximum iteration budget, or observing no improvement in the hypervolume indicator of the Pareto archive over a specified number of iterations. In practice, comparing archive quality across multiple runs at different iteration budgets is a reliable way to diagnose convergence.
Is MOSA suitable for expensive simulation models?
Generally not without modification. Each iteration requires at least one objective function evaluation, and MOSA typically needs thousands of iterations for good Pareto front approximation. When each evaluation involves a costly simulation, surrogate-assisted versions of MOSA (using metamodels to approximate objectives) are preferable.
Sources
- Czyzak, P., Jaszkiewicz, A. (1998). Pareto simulated annealing — a metaheuristic technique for multiple-objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis, 7(1), 34–47. DOI: 10.1007/978-3-642-59132-7_33 ↗
- Serafini, P. (1992). Simulated annealing for multi-objective optimization problems. In Proceedings of the Tenth International Conference on Multiple Criteria Decision Making, Taipei, Taiwan, pp. 87–96. link ↗
How to cite this page
ScholarGate. (2026, June 3). Multi-Objective Simulated Annealing. ScholarGate. https://scholargate.app/en/simulation/multi-objective-simulated-annealing
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Multi-objective genetic algorithmSimulation↔ compare
- Multi-Objective OptimizationSimulation↔ compare
- Multi-objective particle swarm optimizationSimulation↔ compare
- Multi-objective Tabu SearchSimulation↔ compare
- Simulated AnnealingOptimization↔ compare