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/zh/compare