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

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!