A dynamic multi-objective particle swarm optimization algorithm based on adversarial decomposition and neighborhood evolution

Many multi-objective optimization problems in the real world are dynamic, with objectives that conflict and change over time. These problems put higher demands on the algorithm’s convergence performance and the ability to respond to environmental changes. Confronting these two points, this paper pro...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Swarm and evolutionary computation Ročník 69; s. 100987
Hlavní autori: Zheng, Jinhua, Zhang, Zeyu, Zou, Juan, Yang, Shengxiang, Ou, Junwei, Hu, Yaru
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.03.2022
Predmet:
Adversarial decomposition
Dynamic multi-objective optimization
Particle swarm optimization
Dynamic multi-objective optimization
Particle swarm optimization
Adversarial decomposition
ISSN:2210-6502
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Many multi-objective optimization problems in the real world are dynamic, with objectives that conflict and change over time. These problems put higher demands on the algorithm’s convergence performance and the ability to respond to environmental changes. Confronting these two points, this paper proposes a dynamic multi-objective particle swarm optimization algorithm based on adversarial decomposition and neighborhood evolution (ADNEPSO). To overcome the instability of the traditional decomposition method for the changing Pareto optimal front (POF) shape, the proposed algorithm utilizes the complementary characteristics in the search area of the adversarial vector, and the two populations are alternately updated and co-evolved by adversarial search directions. Additionally, a novel particle update strategy is proposed to select promising neighborhood information to guide evolution and enhance diversity. To improve the ability to cope with environmental changes, an effective dynamic response mechanism is proposed, including three parts: archive set prediction, exploration of global optimal information, and retention of excellent particles to accelerate convergence to the Pareto optimal set (POS) in the new environment. The proposed algorithm is tested on a series of benchmark problems and compared to several state-of-the-art algorithms. The results show that ADNEPSO performed excellently in both convergence and diversity, and is highly competitive in dealing with dynamic problems.
ISSN:2210-6502
DOI:10.1016/j.swevo.2021.100987