.png){kind=icon}
返回
Integer cat swarm optimization algorithm for multiobjective integer problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-019-04023-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the literature, several variants of cat swarm optimization (CSO) algorithm are reported. However, CSO for integer multiobjective optimization problems (MOPs) has not yet been investigated. Owing to the frequent occurrence of integer MOPs and their importance in practical design problems, in this work, we investigate a new CSO approach for solving purely integer MOPs. This new approach named as multiobjective integer cat swarm optimization (MO-ICSO) algorithm incorporates the modified version of the CSO algorithm for MOPs. This approach is comprised of the concepts of rounding the floating points to the nearest integer numbers and the probabilistic updating (PU) technique. It uses the idea of Pareto dominance for finding the non-dominated solutions and an external archive for storing these solutions. We demonstrate the power of this new approach via its quantitative analysis and sensitivity test of its several parameters using different performance metrics performed over multiobjective multidimensional knapsack problem and several standard test functions. The simulation results argue that the proposed MO-ICSO approach can be a better candidate for solving the integer MOPs.
Keyword:
Swarm intelligence
Cat swarm optimization
Multiobjective optimization
Integer optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W