.png){kind=icon}
返回
Multi-objective particle swarm optimization with random immigrants
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-020-00159-y.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Complex problems of the current business world need new approaches and new computational algorithms for solution. Majority of the issues need analysis from different angles, and hence, multi-objective solutions are more widely used. One of the recently well-accepted computational algorithms is Multi-objective Particle Swarm Optimization (MOPSO). This is an easily implemented and high time performance nature-inspired approach; however, the best solutions are not found for archiving, solution updating, and fast convergence problems faced in certain cases. This study investigates the previously proposed solutions for creating diversity in using MOPSO and proposes using random immigrants approach. Application of the proposed solution is tested in four different sets using Generational Distance, Spacing, Error Ratio, and Run Time performance measures. The achieved results are statistically tested against mutation-based diversity for all four performance metrics. Advantages of this new approach will support the metaheuristic researchers.
Keyword:
Metaheuristics
Multi-objective optimization
Particle swarm optimization
Random immigrants
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.6
论文数:
2.1K
被引数:
6.6K
机构
引用论文
Adaptive Multiobjective Particle Swarm Optimization Based on Parallel Cell Coordinate System基于并行单元坐标系的自适应多目标粒子群优化算法
PREAI
分享收藏
A Bayesian meta‐analysis of infants’ ability to perceive audio–visual congruence for speech.png)
InfancyOAAI
InfancyIF0
OAAI分享收藏
查看更多内容