เปรียบเทียบวิธี

	Genetic Algorithm	Differential Evolution	NSGA-II	Particle Swarm Optimization (PSO)
สาขาวิชา	การหาค่าเหมาะที่สุด	การหาค่าเหมาะที่สุด	การหาค่าเหมาะที่สุด	การหาค่าเหมาะที่สุด
ตระกูล	Process / pipeline	Process / pipeline	Process / pipeline	Process / pipeline
ปีกำเนิด	1975	1997	2002	1995
ผู้ริเริ่ม	John Henry Holland	Rainer Storn & Kenneth Price	—	—
ประเภท	Population-based metaheuristic	Population-based stochastic metaheuristic	Evolutionary multi-objective optimisation algorithm	Population-based metaheuristic / swarm intelligence
แหล่งต้นตำรับ	Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.	Storn, R. & Price, K. (1997). Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces. Journal of Global Optimization, 11(4), 341–359.	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.	Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948.
ชื่อเรียกอื่น	GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon	DE algorithm, Diferansiyel Evrim (DE), DE optimization	NSGA2, Non-dominated Sorting GA II, NSGA-II — Çok Amaçlı Evrimsel Optimizasyon	PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
ที่เกี่ยวข้อง	5	5	4	6
สรุป	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.	Differential Evolution (DE), introduced by Rainer Storn and Kenneth Price in 1997, is a population-based stochastic optimisation algorithm designed for continuous parameter spaces. It generates candidate solutions by combining vector differences between existing population members, making it a powerful and parameter-lean alternative to Genetic Algorithms and Particle Swarm Optimisation when the search landscape is non-convex, multimodal, or poorly suited to gradient-based methods.	NSGA-II (Non-dominated Sorting Genetic Algorithm II) is the standard reference algorithm for multi-objective evolutionary optimisation, introduced by Deb, Pratap, Agarwal and Meyarivan in 2002. Rather than collapsing multiple conflicting objectives into a single score, it evolves a population of candidate solutions across generations and returns a set of Pareto-optimal trade-off solutions — the Pareto front — using fast non-dominated sorting and a crowding distance metric to preserve diversity.	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.