Robust NSGA-II — Muundo wa Chaguo nyingi chini ya Kutokuwa na uhakika
Robust NSGA-II inapanua algoriti ya zamani ya mageuzi ya NSGA-II ili kuhesabu kutokuwa na uhakika wa kigezo, ikipata suluhisho za biashara za Pareto-optimal ambazo hubaki na utendaji wa juu hata wakati vigezo vya pembejeo vinatoka kwa maadili yao ya kawaida. Badala ya kuongeza thamani za lengo katika nukta moja, inatathmini kila suluhisho la mgombea katika safu au usambazaji wa utambuzi wa kutokuwa na uhakika na huchagua kwa uthabiti pamoja na utawala wa Pareto.
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
- Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182-197. DOI: 10.1109/4235.996017 ↗
- Deb, K., & Gupta, H. (2006). Introducing robustness in multi-objective optimization. Evolutionary Computation, 14(4), 463-494. DOI: 10.1162/evco.2006.14.4.463 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Robust Non-dominated Sorting Genetic Algorithm II. ScholarGate. https://scholargate.app/sw/simulation/robust-nsga-ii
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.
- Multi-Objective Genetic Algorithm (MOGA)Uigaji↔ compare
- Uboreshaji wa Malengo MengiUigaji↔ compare
- Algorithmu ya Kijeni ya ImaraUigaji↔ compare
- Uboreshaji wa Malengo Mengi ImaraUigaji↔ compare
- NSGA-II ya KisayansiUigaji↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →