विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| बहु-उद्देश्यीय जेनेटिक एल्गोरिथम (MOGA)× | बहु-उद्देश्यीय सिमुलेटेड एनीलिंग (MOSA)× | |
|---|---|---|
| क्षेत्र | अनुकरण | अनुकरण |
| परिवार | Process / pipeline | Process / pipeline |
| उद्भव वर्ष≠ | 1984 | 1992–1998 |
| प्रवर्तक≠ | Schaffer, J. D. (early MOGA); Goldberg, D. E. (GA foundations) | Serafini, P.; Czyzak, P. and Jaszkiewicz, A. |
| प्रकार≠ | Population-based evolutionary optimizer | Metaheuristic / Pareto-based optimizer |
| मौलिक स्रोत≠ | Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley. ISBN: 9780201157673 | 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 ↗ |
| उपनाम | MOGA, Multi-objective GA, Evolutionary multi-objective optimization, EMO | MOSA, Multi-Criteria Simulated Annealing, Pareto Simulated Annealing, PSA |
| संबंधित≠ | 4 | 5 |
| सारांश≠ | 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. | 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. |
| ScholarGateडेटासेट ↗ |
|
|