Dynamic Multiobjective Optimization Algorithm Guided by Recurrent Neural Network

In recent years, prediction-based algorithms have attracted much attention for solving dynamic multiobjective optimization (DMO) problems in the evolutionary computing community. However, this class of algorithms still has potential for further improvements by enhancing the historical information ex...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on evolutionary computation Ročník 29; číslo 5; s. 1820 - 1833
Hlavní autoři: Hu, Yaru, Ou, Junwei, Nagaratnam Suganthan, Ponnuthurai, Pedrycz, Witold, Wang, Rui, Zheng, Jinhua, Zou, Juan, Song, Yanjie
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.10.2025
Témata:
Dynamic multiobjective optimization (DMO)
dynamic response
evolutionary algorithm
Feature extraction
Heuristic algorithms
neural network
Optimization
Prediction algorithms
Predictive models
Recurrent neural networks
Sociology
ISSN:1089-778X, 1941-0026
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In recent years, prediction-based algorithms have attracted much attention for solving dynamic multiobjective optimization (DMO) problems in the evolutionary computing community. However, this class of algorithms still has potential for further improvements by enhancing the historical information extraction approach to balance convergence and diversity. In this article, we propose a DMO algorithm based on a recurrent neural network (RNN) to balance the population's convergence and diversity in dynamic environments. The RNN model in the proposed algorithm employs online learning in order to constantly improve according to the increasing evolutionary information. Meanwhile, differing from most existing prediction-based algorithms, the learning machine is not limited by assumptions, such as linear or nonlinear correlation, when it predicts new solutions for future evolutionary environments. Besides, an auxiliary strategy is performed, which adaptively introduces the random or mutated solutions according to the error losses between the prediction solutions and the optimal solutions in the whole optimization process. The experimental results show that the proposed algorithm is more effective for handling DMO problems than several recent algorithms.
ISSN:1089-778X
1941-0026
DOI:10.1109/TEVC.2024.3419892