Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| Multi-objective Tabu Search (MOTS)× | Algoritma Genetik Multi-Objektif (MOGA)× | |
|---|---|---|
| Bidang | Simulasi | Simulasi |
| Keluarga | Process / pipeline | Process / pipeline |
| Tahun asal≠ | 1997 | 1984 |
| Pengasas≠ | Hansen, M. P.; building on Glover (1989) Tabu Search | Schaffer, J. D. (early MOGA); Goldberg, D. E. (GA foundations) |
| Jenis≠ | Metaheuristic multi-objective optimization | Population-based evolutionary optimizer |
| Sumber perintis≠ | 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 ↗ | Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley. ISBN: 9780201157673 |
| Alias | MOTS, Multi-criteria Tabu Search, Pareto Tabu Search, TSMOO | MOGA, Multi-objective GA, Evolutionary multi-objective optimization, EMO |
| Berkaitan≠ | 5 | 4 |
| Ringkasan≠ | 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. | A Multi-Objective Genetic Algorithm (MOGA) is an evolutionary computation method that evolves a population of candidate solutions toward a Pareto-optimal front, simultaneously optimizing two or more conflicting objective functions. It avoids collapsing trade-offs into a single score, instead producing a set of non-dominated solutions for the decision-maker to choose among. |
| ScholarGateSet data ↗ |
|
|