EUVIMEDEUVIMED entdecken
Crossref

An Efficient Evolutionary Algorithm for Few-for-Many Optimization

Ke Shang, Hisao Ishibuchi, Zexuan Zhu, Qingfu Zhang

IEEE/CAA Journal of Automatica Sinica · 2026-06 · 13 (6) · 1362-1377

DOI: 10.1109/jas.2026.125852 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE/CAA Journal of Automatica Sinica, 2026-06. Verfasst von Ke Shang und 3 weiteren Autor:innen. Die Arbeit nennt 54 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Guangdong Basic and Applied Basic Research Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Few-for-many (F4M) optimization, recently introduced as a novel paradigm in multi-objective optimization, aims to find a small set of solutions that effectively handle a large number of conflicting objectives. Unlike traditional many-objective optimization methods, which typically attempt comprehensive coverage of the Pareto front, F4M optimization emphasizes finding a small representative solution set to efficiently address high-dimensional objective spaces. Motivated by the computational complexity and practical relevance of F4M optimization, this paper proposes a new evolutionary algorithm explicitly tailored for efficiently solving F4M optimization problems. Inspired by S-metric selection evolutionary multi-objective optimization algorithm (SMS-EMOA), our proposed approach employs a $(\mu+1)$-evolution strategy guided by the objective of F4M optimization. Furthermore, to facilitate rigorous performance assessment, we propose a novel benchmark test suite specifically designed for F4M optimization by leveraging the similarity between the R2 indicator and F4M formulations. Our test suite is highly flexible, allowing any existing multi-objective optimization problem to be transformed into a corresponding F4M instance via scalarization using the weighted Tchebycheff function. Comprehensive experimental evaluations on benchmarks demonstrate the superior performance of our algorithm compared to existing state-of-the-art algorithms, especially on instances involving a large number of objectives. The source code of the proposed algorithm will be released publicly. Source code is available at https://github.com/MOL-SZU/SoM-EMOA.

Förderung

  • National Natural Science Foundation of China
  • Guangdong Basic and Applied Basic Research Foundation

Zitieren

APA

Shang, K., Ishibuchi, H., Zhu, Z., & Zhang, Q. (2026). An Efficient Evolutionary Algorithm for Few-for-Many Optimization. IEEE/CAA Journal of Automatica Sinica, 13(6), 1362-1377. https://doi.org/10.1109/jas.2026.125852

Vancouver

Shang K, Ishibuchi H, Zhu Z, Zhang Q. An Efficient Evolutionary Algorithm for Few-for-Many Optimization. IEEE/CAA Journal of Automatica Sinica. 2026;13(6):1362-1377. doi:10.1109/jas.2026.125852

BibTeX
@article{Shang2026,
  author = {Shang, Ke and Ishibuchi, Hisao and Zhu, Zexuan and Zhang, Qingfu},
  title = {An Efficient Evolutionary Algorithm for Few-for-Many Optimization},
  journal = {IEEE/CAA Journal of Automatica Sinica},
  year = {2026},
  volume = {13},
  number = {6},
  pages = {1362--1377},
  doi = {10.1109/jas.2026.125852}
}
Kostenlos starten →