方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 多目标禁忌搜索 (MOTS)× | 禁忌搜索× | |
|---|---|---|
| 领域≠ | 仿真 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1997 | 1989 |
| 提出者≠ | Hansen, M. P.; building on Glover (1989) Tabu Search | Fred Glover |
| 类型≠ | Metaheuristic multi-objective optimization | Local-search metaheuristic |
| 开创性文献≠ | 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 ↗ | Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206. link ↗ |
| 别名≠ | MOTS, Multi-criteria Tabu Search, Pareto Tabu Search, TSMOO | Tabu Araması (Tabu Search), TS, tabu metaheuristic |
| 相关≠ | 5 | 4 |
| 摘要≠ | 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. | Tabu Search is a local-search metaheuristic introduced by Fred Glover in 1989 that uses a tabu list — a short-term memory of recently visited solutions — to prevent cycling and escape local optima. By explicitly forbidding moves that reverse recent decisions, the algorithm explores the search space more broadly and, through long-term memory structures such as aspiration criteria, aims to approach the global optimum even in large, complex combinatorial problems. |
| ScholarGate数据集 ↗ |
|
|