ScholarGate
Assistent
Process / pipelineSimulation / optimization

Multi-objektiv genetisk algoritme (MOGA) — Evolutionær søgning efter Pareto-optimale løsninger

En multi-objektiv genetisk algoritme (MOGA) er en evolutionær beregningsmetode, der udvikler en population af kandidatløsninger mod en Pareto-optimal front, idet den samtidigt optimerer to eller flere modstridende objektive funktioner. Den undgår at kollapse afvejninger til en enkelt score, men producerer i stedet et sæt af ikke-dominerede løsninger, som beslutningstageren kan vælge imellem.

Åbn i MethodMindSnartVideoSnartDownload slides

Læs hele metoden

Kun for medlemmer

Log ind med en gratis konto for at læse dette afsnit.

Log ind

Method map

The neighbourhood of related methods — select a node to explore.

+9 more

Kilder

  1. Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley. ISBN: 9780201157673
  2. 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

Sådan citerer du denne side

ScholarGate. (2026, June 3). Multi-Objective Genetic Algorithm (MOGA). ScholarGate. https://scholargate.app/da/simulation/multi-objective-genetic-algorithm

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.

Compare side by side

Refereret af

ScholarGateMulti-objective genetic algorithm (Multi-Objective Genetic Algorithm (MOGA)). Hentet 2026-06-15 fra https://scholargate.app/da/simulation/multi-objective-genetic-algorithm · Datasæt: https://doi.org/10.5281/zenodo.20539026