Weight-based Fish School Search algorithm for Many-Objective Optimization
F. B. Lima Neto, I. M. C. Albuquerque, J. B. Monteiro Filho

TL;DR
This paper introduces a novel Fish School Search algorithm adapted for many-objective optimization, utilizing clustering and decomposition techniques to improve performance on complex multi-objective problems.
Contribution
It presents a new fish school search method that employs clustering and problem decomposition to effectively handle many-objective optimization challenges.
Findings
The proposed algorithm performs competitively with state-of-the-art methods.
Clustering and decomposition improve solution diversity and convergence.
The multi-modal version enhances performance on complex problems.
Abstract
Optimization problems with more than one objective consist in a very attractive topic for researchers due to its applicability in real-world situations. Over the years, the research effort in the Computational Intelligence field resulted in algorithms able to achieve good results by solving problems with more than one conflicting objective. However, these techniques do not exhibit the same performance as the number of objectives increases and become greater than 3. This paper proposes an adaptation of the metaheuristic Fish School Search to solve optimization problems with many objectives. This adaptation is based on the division of the candidate solutions in clusters that are specialized in solving a single-objective problem generated by the decomposition of the original problem. For this, we used concepts and ideas often employed by state-of-the-art algorithms, namely: (i) reference…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMetaheuristic Optimization Algorithms Research
