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...

Full description

Saved in:
Bibliographic Details
Published in:Swarm and evolutionary computation Vol. 69; p. 100987
Main Authors: Zheng, Jinhua, Zhang, Zeyu, Zou, Juan, Yang, Shengxiang, Ou, Junwei, Hu, Yaru
Format: Journal Article
Language:English
Published: Elsevier B.V 01.03.2022
Subjects:
ISSN:2210-6502
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first