ScholarGate
어시스턴트

방법 비교

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

강건한 입자 군집 최적화×다목적 입자 군집 최적화 (MOPSO)×
분야시뮬레이션시뮬레이션
계열Process / pipelineProcess / pipeline
기원 연도2000s2004
창시자Kennedy, J. & Eberhart, R. C. (PSO); robustness extensions by multiple authors, 2000sCoello Coello, C. A., Pulido, G. T., & Lechuga, M. S.
유형Metaheuristic — robust swarm-based optimizerPopulation-based swarm metaheuristic
원전Kennedy, J., Eberhart, R. C., & Shi, Y. (2001). Swarm Intelligence. Morgan Kaufmann Publishers. ISBN: 9781558605954Coello Coello, C. A., Pulido, G. T., & Lechuga, M. S. (2004). Handling multiple objectives with particle swarm optimization. IEEE Transactions on Evolutionary Computation, 8(3), 256–279. DOI ↗
별칭Robust PSO, RPSO, Uncertainty-robust PSO, PSO with robustnessMOPSO, Multi-objective PSO, Pareto PSO, Vector-evaluated PSO
관련65
요약Robust Particle Swarm Optimization (Robust PSO) extends the classical PSO metaheuristic to explicitly account for uncertainty in the objective function, constraints, or decision variables. Rather than optimizing a single nominal objective, each candidate solution is evaluated over a set of uncertainty scenarios, and fitness is judged by a robustness criterion such as worst-case performance or expected value, yielding solutions that remain near-optimal even when conditions deviate from nominal assumptions.Multi-Objective Particle Swarm Optimization (MOPSO) is a swarm-intelligence metaheuristic that extends the original Particle Swarm Optimization (PSO) to handle multiple conflicting objective functions simultaneously. It maintains an external Pareto archive and uses dominance-based selection to guide a population of candidate solutions toward the true Pareto front without requiring a priori preference information.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

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

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