EUVIMEDEUVIMED entdecken
Crossref

Bilevel Evolutionary Multiobjective Algorithm With Multiple Lower-Level Search Modes

Ning Yang, Hai-Lin Liu

IEEE Transactions on Evolutionary Computation · 2026-02 · 30 (1) · 296-310

DOI: 10.1109/tevc.2025.3544821 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Evolutionary Computation, 2026-02. Verfasst von Ning Yang und 1 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 33 Literaturangaben. Gefördert von: Ph.D. Start-Up Foundation of Jiangxi University of Science and Technology, Platform Opening Project of Jiangxi University of Science and Technology, Jiangxi Province Key Laboratory of Multidimensional Intelligent Perception and Control, China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In bilevel optimization, the upper-level optimization problem (ULOP) requires to be solved under the constraint of the inner lower-level optimization problem (LLOP). However, it is computationally expensive to always consider the constraint caused by the LLOP in a higher priority because heavy evaluation budgets are required for validating the constraint satisfaction. From this aspect, this article investigates bilevel evolutionary multiobjective optimization with multiple lower-level search modes (BLEMO-MLS). Assisted by self-learning and reinforcement, BLEMO-MLS could adaptively adjust the priority of considering more on the upper-level objective optimization or the constraint caused by the LLOP. In BLEMO-MLS, three lower-level search (LLS) modes are designed to handle the constraint caused by the LLOP. The former two search modes have higher priorities on the satisfaction of the constraint caused by the LLOP, where lower-level decisions of solutions are optimized by a hybrid LLS method, while the last search mode has a higher priority on the upper-level objective optimization with the constraint caused by the LLOP temporarily ignored. Through self-learning and reinforcement, BLEMO-MLS dynamically selects proper LLS modes in the bilevel optimization process, aiming to obtain approximate bilevel Pareto-optimal solutions fulfilling the constraint caused by the LLOP as much as possible. Compared with five existing bilevel evolutionary algorithms, BLEMO-MLS could effectively solve bilevel multiobjective optimization problems (BLMOPs) with function evaluations (FEs) saved in both levels.

Förderung

  • Ph.D. Start-Up Foundation of Jiangxi University of Science and Technology
  • Platform Opening Project of Jiangxi University of Science and Technology
  • Jiangxi Province Key Laboratory of Multidimensional Intelligent Perception and Control, China
  • Natural Science Foundation of Guangdong Province
  • National Natural Science Foundation of China

Zitieren

APA

Yang, N., & Liu, H. (2026). Bilevel Evolutionary Multiobjective Algorithm With Multiple Lower-Level Search Modes. IEEE Transactions on Evolutionary Computation, 30(1), 296-310. https://doi.org/10.1109/tevc.2025.3544821

Vancouver

Yang N, Liu H. Bilevel Evolutionary Multiobjective Algorithm With Multiple Lower-Level Search Modes. IEEE Transactions on Evolutionary Computation. 2026;30(1):296-310. doi:10.1109/tevc.2025.3544821

BibTeX
@article{Yang2026,
  author = {Yang, Ning and Liu, Hai-Lin},
  title = {Bilevel Evolutionary Multiobjective Algorithm With Multiple Lower-Level Search Modes},
  journal = {IEEE Transactions on Evolutionary Computation},
  year = {2026},
  volume = {30},
  number = {1},
  pages = {296--310},
  doi = {10.1109/tevc.2025.3544821}
}
Kostenlos starten →