Utafutaji wa Tabu Wenye Malengo Mengi (MOTS) — Metaheuristic kwa suluhisho bora za Pareto
Utafutaji wa Tabu Wenye Malengo Mengi (MOTS) ni algoriti ya metaheuristic inayopanua mfumo wa kawaida wa Utafutaji wa Tabu ili kuboresha kwa wakati mmoja kazi mbili au zaidi za malengo yanayokinzana. Badala ya optimumu moja, inatafuta kukadiria mpaka wa Pareto — seti ya suluhisho ambapo hakuna lengo linaloweza kuboreshwa bila kuzorotesha lingine — na kuifanya ifae kwa matatizo changamano ya uboreshaji wa mchanganyiko na endelevu katika uhandisi, vifaa, na utafiti wa uendeshaji.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- 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. DOI: 10.1287/ijoc.1.3.190 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Multi-objective Tabu Search (MOTS) — Metaheuristic optimization for multiple conflicting objectives. ScholarGate. https://scholargate.app/sw/simulation/multi-objective-tabu-search
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.
- Uboreshaji wa Koloni la Sisimizi Lenye Malengo Mengi (MOACO)Uigaji↔ compare
- Multi-Objective Genetic Algorithm (MOGA)Uigaji↔ compare
- Multi-Objective Particle Swarm Optimization (MOPSO)Uigaji↔ compare
- Multi-Objective Simulated Annealing (MOSA)Uigaji↔ compare
- Utafutaji TabuUboreshaji↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →