.png){kind=icon}
.png){kind=icon}
Return
A coevolutionary technique based on multi-swarm particle swarm optimization for dynamic multi-objective optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2017.03.048.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In real-world applications, there are many fields involving dynamic multi-objective optimization problems (DMOPs), in which objectives are in conflict with each other and change over time or environments. In this paper, a modified coevolutionary multi-swarm particle swarm optimizer is proposed to solve DMOPs in the rapidly changing environments (denoted as CMPSODMO). A frame of multi-swarm based particle swarm optimization is adopted to optimize the problem in dynamic environments. In CMPSODMO, the number of swarms (PSO) is determined by the number of the objective functions, and all of these swarms utilize an information sharing strategy to evolve cooperatively. Moreover, a new velocity update equation and an effective boundary constraint technique are developed during evolution of each swarm. Then, a similarity detection operator is used to detect whether a change has occurred, followed by a memory based dynamic mechanism to response to the change. The proposed CMPSODMO has been extensively compared with five state-of-the-art algorithms over a test suit of benchmark problems. Experimental results indicate that the proposed algorithm is promising for dealing with the DMOPs in the rapidly changing environments. (C) 2017 Elsevier B.V. All rights reserved.
Keywords:
Multiple objective programming
Dynamic multi-objective optimization
Coevolution
Multi-swarm Particle swarm optimization
Similarity detective
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W