ScholarGate
Асистент

Сравнение на методи

Прегледайте избраните методи един до друг; редовете с разлики са откроени.

Генетичен алгоритъм×Программиране с целеви стойности (Goal Programming)×
ОбластОптимизацияВземане на решения
СемействоProcess / pipelineMCDM
Година на възникване19751955
СъздателJohn Henry HollandCharnes, A., Cooper, W. W.
ТипPopulation-based metaheuristicMulti-objective optimisation — weighted/lexicographic goal deviation minimisation
Основополагащ източникHolland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗Charnes, A., Cooper, W. W. (1955). Optimal estimation of executive compensation by linear programming. Management Science DOI ↗
Други названияGA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon
Свързани58
РезюмеA genetic algorithm (GA) is a population-based metaheuristic optimization method introduced by John Henry Holland (1975) that mimics the principles of natural selection. It maintains a population of candidate solutions and iteratively improves them through selection, crossover, and mutation operators, making it especially powerful on discontinuous, non-convex, and multi-modal search spaces where classical gradient-based methods fail.GOAL-PROGRAMMING (Goal Programming — Minimise deviations from multiple aspiration levels) is a ranking multi-criteria decision-making (MCDM) method introduced by Charnes, A., Cooper, W. W. in 1955. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result.
ScholarGateНабор от данни
  1. v1
  2. 2 Източници
  3. PUBLISHED
  1. v1
  2. 1 Източници
  3. PUBLISHED

Към търсенето Изтегляне на слайдове

ScholarGateСравнение на методи: Genetic Algorithm · GOAL-PROGRAMMING. Извлечено на 2026-06-15 от https://scholargate.app/bg/compare