.png){kind=icon}
.png){kind=icon}
Return
Solving multiobjective problems using cat swarm optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2011.08.157.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a new multiobjective evolutionary algorithm (MOEA) by extending the existing cat swarm optimization (CSO). It finds the nondominated solutions along the search process using the concept of Pareto dominance and uses an external archive for storing them. The performance of our proposed approach is demonstrated using standard test functions. A quantitative assessment of the proposed approach and the sensitivity test of different parameters is carried out using several performance metrics. The simulation results reveal that the proposed approach can be a better candidate for solving multiobjective problems (MOPs). (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Multiobjective problems
Evolutionary algorithm
Swarm optimization
Cat swarm optimization
Multiobjective cat swarm optimization
Pareto dominance
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W