A dynamic multi-objective evolutionary algorithm based on geometric prediction and vector–scalar transformation strategy

Dynamic multi-objective evolutionary algorithms (DMOEAs) have attracted significant attention from scholars due to their strong robustness and wide range of applications across various fields. A current research focus is on how to quickly track the changing Pareto Set (PS) and Pareto Front (PF); how...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Swarm and evolutionary computation Jg. 96; S. 101987
Hauptverfasser: Zhao, Yan, Ma, Yongjie, Yang, Yue
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.07.2025
Schlagworte:
Dynamic multi-objective optimization
Geometric prediction
Mirror adjustment strategy
Vector–scalar transformation
Mirror adjustment strategy
Dynamic multi-objective optimization
Geometric prediction
Vector–scalar transformation
ISSN:2210-6502
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Dynamic multi-objective evolutionary algorithms (DMOEAs) have attracted significant attention from scholars due to their strong robustness and wide range of applications across various fields. A current research focus is on how to quickly track the changing Pareto Set (PS) and Pareto Front (PF); however, the distribution of optimal individuals on the PF is often overlooked. To address this issue, we propose a dynamic multi-objective evolutionary algorithm based on geometric prediction and vector–scalar transformation strategy (GPVS). By combining memory and diversity strategies, we propose a zoom-in and zoom-out prediction strategy for population range estimation based on a geometric center point. The mirror adjustment strategy is introduced as a prediction adjustment mechanism to accelerate the algorithm’s convergence. The vector–scalar transformation strategy optimizes the distribution of the evolved population following geometric prediction, ensuring that individuals carry the maximum possible evolutionary information. This strategy provides valuable population information for the next evolution. We evaluated the performance of the proposed algorithm through experimental comparisons with classical algorithms on 22 test functions, demonstrating its effectiveness and robustness in solving dynamic multi-objective optimization problems (DMOPs). •A prediction strategy based on geometric center point is devised.•A mirror adjustment strategy is designed to improve the convergence of the algorithm.•A vector–scalar transformation strategy is set to optimize population distribution.
ISSN:2210-6502
DOI:10.1016/j.swevo.2025.101987