방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 다목적 최적화× | 입자 군집 최적화 (PSO)× | |
|---|---|---|
| 분야≠ | 시뮬레이션 | 최적화 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1896 (concept); 1989–2002 (evolutionary algorithms era) | 1995 |
| 창시자≠ | Vilfredo Pareto (concept); modern computational formulation by Goldberg and Deb et al. | — |
| 유형≠ | Optimization framework | Population-based metaheuristic / swarm intelligence |
| 원전≠ | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396 | Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗ |
| 별칭≠ | MOO, Multi-Criteria Optimization, Vector Optimization, Pareto Optimization | PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO) |
| 관련≠ | 3 | 6 |
| 요약≠ | Multi-Objective Optimization (MOO) is a mathematical and computational framework for finding solutions that simultaneously optimize two or more conflicting objective functions. Rather than collapsing all goals into a single scalar, MOO produces a set of trade-off solutions — the Pareto front — from which a decision-maker selects according to preference. It is widely used in engineering design, operations research, logistics, economics, and policy analysis. | 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데이터셋 ↗ |
|
|