.png){kind=icon}
Return
A novel group search optimizer for multi-objective optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2011.08.155.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a novel multi-objective group search optimizer named NMGSO is proposed for solving the multi-objective optimization problems. To simplify the computation, the scanning strategy of the original GSO is replaced by the limited pattern search procedure. To enrich the search behavior of the rangers, a special mutation with a controlling probability is designed to balance the exploration and exploitation at different searching stages and randomness is introduced in determining the coefficients of members to enhance the diversity. To handle multiple objectives, the non-dominated sorting scheme and multiple producers are used in the algorithm. In addition, the kernel density estimator is used to keep diversity. Simulation results based on a set of benchmark functions and comparisons with some methods demonstrate the effectiveness and robustness of the proposed algorithm, especially for the high-dimensional problems. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Group search optimizer
Multi-objective optimization
Limited pattern search
Multiple producer
Kernel density estimator
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
Organization
Cited Papers
.png){kind=icon}
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach
PREAI
ShareSaveShareSaveFloquet Majorana Fermions for Topological Qubits in Superconducting Devices and Cold-Atom Systems
OAAI
OAAIShareSave
View more