.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Swarm intelligence
Cat swarm optimization
Multiobjective optimization
Integer optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W