Difficulties in fair performance comparison of multiobjective evolutionary algorithms

H Ishibuchi, LM Pang, K Shang - Proceedings of the Genetic and …, 2022 - dl.acm.org
Proceedings of the Genetic and Evolutionary Computation Conference Companion:
Difficulties in fair performance comparison of mul Page 1 1 Difficulties in Fair Performance …

A diversity-enhanced subset selection framework for multimodal multiobjective optimization

Y Peng, H Ishibuchi - IEEE Transactions on Evolutionary …, 2021 - ieeexplore.ieee.org
Multimodality is commonly seen in real-world multiobjective optimization problems (MOPs).
In such optimization problems, namely, multimodal MOPs (MMOPs), multiple decision …

Fast greedy subset selection from large candidate solution sets in evolutionary multiobjective optimization

W Chen, H Ishibuchi, K Shang - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
Subset selection plays an important role in the field of evolutionary multiobjective
optimization (EMO). Especially, in an EMO algorithm with an unbounded external archive …

[图书][B] Archiving strategies for evolutionary multi-objective optimization algorithms

O Schütze, C Hernández - 2021 - Springer
This book presents an overview of several archiving strategies we have developed over the
last years dealing with approximations of the solution sets of multi-objective optimization …

A bounded archiver for Hausdorff approximations of the Pareto front for multi-objective evolutionary algorithms

CI Hernández Castellanos, O Schütze - Mathematical and Computational …, 2022 - mdpi.com
Multi-objective evolutionary algorithms (MOEAs) have been successfully applied for the
numerical treatment of multi-objective optimization problems (MOP) during the last three …

Clustering-based subset selection in evolutionary multiobjective optimization

W Chen, H Ishibuchi, K Shang - 2021 IEEE International …, 2021 - ieeexplore.ieee.org
Subset selection is an important component in evolutionary multiobjective optimization
(EMO) algorithms. Clustering, as a classic method to group similar data points together, has …

Finding the Set of Nearly Optimal Solutions of a Multi-Objective Optimization Problem

O Schütze, AE Rodriguez-Fernandez… - IEEE Transactions …, 2024 - ieeexplore.ieee.org
Evolutionary multi-objective optimization (EMO) is a highly active research field that has
attracted many researchers and practitioners over the past three decades. Surprisingly, until …

Improving local search hypervolume subset selection in evolutionary multi-objective optimization

Y Nan, K Shang, H Ishibuchi… - 2021 IEEE International …, 2021 - ieeexplore.ieee.org
Hypervolume subset selection is a hot topic in the field of evolutionary multi-objective
optimization (EMO) due to the increasing needs of selecting a small set of representative …

Estimation of distribution algorithms with solution subset selection for the next release problem

V Pérez-Piqueras, PB López… - Logic Journal of the …, 2024 - academic.oup.com
Abstract The Next Release Problem (NRP) is a combinatorial optimization problem that aims
to find a subset of software requirements to be delivered in the next software release, which …

A bounded archive based for bi-objective problems based on distance and e-dominance to avoid cyclic behavior

C Hernández, O Schütze - Proceedings of the Genetic and Evolutionary …, 2022 - dl.acm.org
One important issue in evolutionary multi-objective optimization (EMO) which still leaves
room for improvement is the maintenance of the subset of the obtained candidate solutions …