A dual-population algorithm based on alternative evolution and degeneration for solving constrained multi-objective optimization problems

•The proposed algorithm has a higher utilization of its secondary population.•Proposed algorithm enhance cooperation appropriately to have a better performance.•The proposed algorithm is competitive when compared to the Dual-popualtion CMOEAs. It is challenging to solve constrained multi-objective o...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information sciences Ročník 579; s. 89 - 102
Hlavní autoři: Zou, Juan, Sun, Ruiqing, Yang, Shengxiang, Zheng, Jinhua
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.11.2021
Témata:
Constrained multi-objective optimization
Dual population
Evolutionary algorithm
Dual population
Constrained multi-objective optimization
Evolutionary algorithm
ISSN:0020-0255, 1872-6291
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í:•The proposed algorithm has a higher utilization of its secondary population.•Proposed algorithm enhance cooperation appropriately to have a better performance.•The proposed algorithm is competitive when compared to the Dual-popualtion CMOEAs. It is challenging to solve constrained multi-objective optimization problems (CMOPs). Different from the traditional multi-objective optimization problem, the feasibility, convergence, and diversity of the population must be considered in the optimization process of a CMOP. How these factors are balanced will affect the performance of the constrained multi-objective optimization algorithm. To solve this problem, we propose a dual-population multi-objective optimization evolutionary algorithm. The proposed algorithm can make good use of its secondary population and alternative between evolution and degeneration according to the state of the secondary population to provide better information for the main population. The test results of three benchmark constrained multi-objective optimization problem suites, and four real-world constrained multi-objective optimization problems show that the algorithm is better than existing dual-population multi-objective optimization, especially when there is a distance between the unconstrained PF and the constrained PF.
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2021.07.078