ScholarGate
Ассистент

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

Просматривайте выбранные методы рядом; строки с различиями подсвечены.

Генетический алгоритм×Оптимизация роем частиц (PSO)×
ОбластьОптимизацияОптимизация
СемействоProcess / pipelineProcess / pipeline
Год появления19751995
Автор методаJohn Henry Holland
ТипPopulation-based metaheuristicPopulation-based metaheuristic / swarm intelligence
Основополагающий источникHolland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗
Другие названияGA, evolutionary algorithm, Genetik Algoritma — Evrimsel OptimizasyonPSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
Связанные56
Сводка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.Particle Swarm Optimization (PSO) is a population-based metaheuristic algorithm introduced by Kennedy and Eberhart in 1995, inspired by the collective movement of bird flocks and fish schools. Each candidate solution — called a particle — moves through the search space by updating its velocity and position based on its own best experience and the best experience of the entire swarm, enabling fast convergence across continuous optimization problems.
ScholarGateНабор данных
  1. v1
  2. 2 Источники
  3. PUBLISHED
  1. v1
  2. 2 Источники
  3. PUBLISHED

Перейти к поиску Скачать слайды

ScholarGateСравнение методов: Genetic Algorithm · Particle Swarm Optimization. Получено 2026-06-15 из https://scholargate.app/ru/compare