ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

확률적 입자 군집 최적화×불확실성 하에서 다중 상충 목표를 최적화하는 확률적 다목표 최적화×
분야시뮬레이션시뮬레이션
계열Process / pipelineProcess / pipeline
기원 연도1995–20021990s–2000s
창시자Kennedy, J. and Eberhart, R. (base PSO); stochastic extensions by Clerc, Kennedy and communityVarious (Fonseca, Fleming, Deb, Zitzler, and others)
유형Metaheuristic optimization — stochastic swarm intelligenceStochastic metaheuristic optimization
원전Kennedy, J., Eberhart, R. (1995). Particle swarm optimization. Proceedings of ICNN'95 - International Conference on Neural Networks, Vol. 4, pp. 1942-1948. IEEE. DOI ↗Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396
별칭Stochastic PSO, SPSO, Randomized PSO, Probabilistic PSOSMOO, Stochastic MOO, Multi-objective optimization under uncertainty, Robust multi-objective optimization
관련45
요약Stochastic Particle Swarm Optimization (Stochastic PSO) is a swarm-intelligence metaheuristic that extends the standard PSO framework by incorporating explicit stochastic elements — random inertia weights, probabilistic velocity resets, or noise injections — to escape local optima and maintain population diversity throughout the search. It is widely applied to continuous, mixed, and noisy optimization problems in engineering, operations research, and simulation-based design.Stochastic Multi-Objective Optimization (SMOO) is a class of methods that simultaneously optimizes two or more conflicting objectives when parameters, costs, or constraints are uncertain or random. Rather than a single optimal solution, it produces a Pareto front of non-dominated solutions, each representing a different balance among objectives under the modeled uncertainty.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Stochastic Particle Swarm Optimization · Stochastic Multi-Objective Optimization. 2026-06-17에 다음에서 검색함: https://scholargate.app/ko/compare