Comparer des méthodes

	Recherche Tabou Multi-objectif (RTMO)	Recuit Simulé Multi-Objectif (MOSA)
Domaine	Simulation	Simulation
Famille	Process / pipeline	Process / pipeline
Année d'origine	1997	1992–1998
Auteur d'origine	Hansen, M. P.; building on Glover (1989) Tabu Search	Serafini, P.; Czyzak, P. and Jaszkiewicz, A.
Type	Metaheuristic multi-objective optimization	Metaheuristic / Pareto-based optimizer
Source fondatrice	Hansen, M. P. (1997). Tabu search for multiobjective optimization: MOTS. Presented at the 13th International Conference on Multiple Criteria Decision Making (MCDM), Cape Town, South Africa.	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.
Alias	MOTS, Multi-criteria Tabu Search, Pareto Tabu Search, TSMOO	MOSA, Multi-Criteria Simulated Annealing, Pareto Simulated Annealing, PSA
Apparentées	5	5
Résumé	Multi-objective Tabu Search (MOTS) is a metaheuristic algorithm that extends the classic Tabu Search framework to simultaneously optimize two or more conflicting objective functions. Instead of a single optimum, it seeks to approximate the Pareto front — the set of solutions where no objective can be improved without worsening another — making it suitable for complex combinatorial and continuous optimization problems in engineering, logistics, and operations research.	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.