مقایسهٔ روشها
روشهای انتخابی خود را کنار هم مرور کنید؛ ردیفهای متفاوت برجسته شدهاند.
| بهینهسازی شبیهسازی شده چندهدفه (MOSA)× | جستجوی تَبُو چندهدفه (MOTS)× | |
|---|---|---|
| حوزه | شبیهسازی | شبیهسازی |
| خانواده | Process / pipeline | Process / pipeline |
| سال پیدایش≠ | 1992–1998 | 1997 |
| پدیدآور≠ | Serafini, P.; Czyzak, P. and Jaszkiewicz, A. | Hansen, M. P.; building on Glover (1989) Tabu Search |
| نوع≠ | Metaheuristic / Pareto-based optimizer | Metaheuristic multi-objective optimization |
| منبع بنیادین≠ | 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 ↗ | 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. link ↗ |
| نامهای دیگر | MOSA, Multi-Criteria Simulated Annealing, Pareto Simulated Annealing, PSA | MOTS, Multi-criteria Tabu Search, Pareto Tabu Search, TSMOO |
| مرتبط | 5 | 5 |
| خلاصه≠ | 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. | 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. |
| ScholarGateمجموعهداده ↗ |
|
|