Loading…

A two-stage evolutionary algorithm assisted by multi-archives for constrained multi-objective optimization

Due to the widespread existence of constrained multi-objective optimization problems (CMOPs) in real life, many researchers start to research the constrained multi-objective evolutionary algorithms (CMOEAs). Therefore, a variety of CMOEAs have emerged. However, some of them still suffer from great d...

Full description

Saved in:
Bibliographic Details
Published in:Applied soft computing 2024-09, Vol.162, p.111840, Article 111840
Main Authors: Zhang, Wenjuan, Liu, Jianchang, Zhang, Wei, Liu, Yuanchao, Tan, Shubin
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c251t-34d18d6fdc3037abac2fad6978d23bef11ad983e97aa7dc9eed32e9473f53a7b3
container_end_page
container_issue
container_start_page 111840
container_title Applied soft computing
container_volume 162
creator Zhang, Wenjuan
Liu, Jianchang
Zhang, Wei
Liu, Yuanchao
Tan, Shubin
description Due to the widespread existence of constrained multi-objective optimization problems (CMOPs) in real life, many researchers start to research the constrained multi-objective evolutionary algorithms (CMOEAs). Therefore, a variety of CMOEAs have emerged. However, some of them still suffer from great difficulties when coping with CMOPs with complex feasible regions. To solve the issue, this article puts forward a two-stage evolutionary algorithm assisted by multi-archives for constrained multi-objective optimization, called MA-TSEA. In MA-TSEA, the evolution process is divided into two stages. In Stage 1, non-dominated solutions obtained by non-dominated sorting based on (M+1) objectives ( i.e., M objectives and the constraint violation degree (CV) ) are stored in a temporary archive and merged with the parent population to improve the exploration ability of population. Then, MA-TSEA drives the populations to evolve from diverse directions by a multi-objective evolutionary algorithm, while the feasible solutions are saved in a formal archive. Next, the formal archive is updated to improve convergence and diversity. In Stage 2, the main population and archive population cooperate to evolve towards the constrained Pareto front (CPF), where the formal archive and population of Stage 1 are respectively used as the main population and archive population. The experimental studies on five benchmark test suites and five real-world applications demonstrate the superiority of MA-TSEA over the other seven state-of-art CMOEAs. •A MA-TSEA method is develop for CMOPs.•Two stages are used in MA-TSEA with different purposes.•Multiple archives assist the MA-TSEA find the complete constraint Pareto front.•MA-TSEA can achieve better results compared with its seven competitors.
doi_str_mv 10.1016/j.asoc.2024.111840
format article
fullrecord <record><control><sourceid>elsevier_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1016_j_asoc_2024_111840</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1568494624006148</els_id><sourcerecordid>S1568494624006148</sourcerecordid><originalsourceid>FETCH-LOGICAL-c251t-34d18d6fdc3037abac2fad6978d23bef11ad983e97aa7dc9eed32e9473f53a7b3</originalsourceid><addsrcrecordid>eNp9kM1OwzAQhC0EEqXwApz8AgmxnSa2xKWq-JMqcYGztbE3raOkrmy3CJ6eROHMaVfamdHOR8g9K3JWsOqhyyF6k_OClzljTJbFBVkwWfNMVZJdjvuqklmpyuqa3MTYFaNJcbkg3ZqmL5_FBDukePb9KTl_gPBNod_54NJ-oBCjiwktbb7pcOqTyyCYvTtjpK0P1PhDTAHcYVTMZ990aNIooP6Y3OB-YAq9JVct9BHv_uaSfD4_fWxes-37y9tmvc0MX7GUidIyaavWGlGIGhowvAVbqVpaLhpsGQOrpEBVA9TWKEQrOKqyFu1KQN2IJeFzrgk-xoCtPgY3jJU0K_RES3d6oqUnWnqmNZoeZxOOn50dBh2Nw4NB68LYRVvv_rP_Ap1Vd4o</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A two-stage evolutionary algorithm assisted by multi-archives for constrained multi-objective optimization</title><source>ScienceDirect Freedom Collection</source><creator>Zhang, Wenjuan ; Liu, Jianchang ; Zhang, Wei ; Liu, Yuanchao ; Tan, Shubin</creator><creatorcontrib>Zhang, Wenjuan ; Liu, Jianchang ; Zhang, Wei ; Liu, Yuanchao ; Tan, Shubin</creatorcontrib><description>Due to the widespread existence of constrained multi-objective optimization problems (CMOPs) in real life, many researchers start to research the constrained multi-objective evolutionary algorithms (CMOEAs). Therefore, a variety of CMOEAs have emerged. However, some of them still suffer from great difficulties when coping with CMOPs with complex feasible regions. To solve the issue, this article puts forward a two-stage evolutionary algorithm assisted by multi-archives for constrained multi-objective optimization, called MA-TSEA. In MA-TSEA, the evolution process is divided into two stages. In Stage 1, non-dominated solutions obtained by non-dominated sorting based on (M+1) objectives ( i.e., M objectives and the constraint violation degree (CV) ) are stored in a temporary archive and merged with the parent population to improve the exploration ability of population. Then, MA-TSEA drives the populations to evolve from diverse directions by a multi-objective evolutionary algorithm, while the feasible solutions are saved in a formal archive. Next, the formal archive is updated to improve convergence and diversity. In Stage 2, the main population and archive population cooperate to evolve towards the constrained Pareto front (CPF), where the formal archive and population of Stage 1 are respectively used as the main population and archive population. The experimental studies on five benchmark test suites and five real-world applications demonstrate the superiority of MA-TSEA over the other seven state-of-art CMOEAs. •A MA-TSEA method is develop for CMOPs.•Two stages are used in MA-TSEA with different purposes.•Multiple archives assist the MA-TSEA find the complete constraint Pareto front.•MA-TSEA can achieve better results compared with its seven competitors.</description><identifier>ISSN: 1568-4946</identifier><identifier>EISSN: 1872-9681</identifier><identifier>DOI: 10.1016/j.asoc.2024.111840</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Constrained multi-objective optimization ; Evolutionary algorithm ; Multi-archives ; Two-stage framework</subject><ispartof>Applied soft computing, 2024-09, Vol.162, p.111840, Article 111840</ispartof><rights>2024 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c251t-34d18d6fdc3037abac2fad6978d23bef11ad983e97aa7dc9eed32e9473f53a7b3</cites><orcidid>0000-0002-2801-8312 ; 0000-0003-0580-1387 ; 0009-0002-1860-987X ; 0000-0002-5082-6834</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27900,27901</link.rule.ids></links><search><creatorcontrib>Zhang, Wenjuan</creatorcontrib><creatorcontrib>Liu, Jianchang</creatorcontrib><creatorcontrib>Zhang, Wei</creatorcontrib><creatorcontrib>Liu, Yuanchao</creatorcontrib><creatorcontrib>Tan, Shubin</creatorcontrib><title>A two-stage evolutionary algorithm assisted by multi-archives for constrained multi-objective optimization</title><title>Applied soft computing</title><description>Due to the widespread existence of constrained multi-objective optimization problems (CMOPs) in real life, many researchers start to research the constrained multi-objective evolutionary algorithms (CMOEAs). Therefore, a variety of CMOEAs have emerged. However, some of them still suffer from great difficulties when coping with CMOPs with complex feasible regions. To solve the issue, this article puts forward a two-stage evolutionary algorithm assisted by multi-archives for constrained multi-objective optimization, called MA-TSEA. In MA-TSEA, the evolution process is divided into two stages. In Stage 1, non-dominated solutions obtained by non-dominated sorting based on (M+1) objectives ( i.e., M objectives and the constraint violation degree (CV) ) are stored in a temporary archive and merged with the parent population to improve the exploration ability of population. Then, MA-TSEA drives the populations to evolve from diverse directions by a multi-objective evolutionary algorithm, while the feasible solutions are saved in a formal archive. Next, the formal archive is updated to improve convergence and diversity. In Stage 2, the main population and archive population cooperate to evolve towards the constrained Pareto front (CPF), where the formal archive and population of Stage 1 are respectively used as the main population and archive population. The experimental studies on five benchmark test suites and five real-world applications demonstrate the superiority of MA-TSEA over the other seven state-of-art CMOEAs. •A MA-TSEA method is develop for CMOPs.•Two stages are used in MA-TSEA with different purposes.•Multiple archives assist the MA-TSEA find the complete constraint Pareto front.•MA-TSEA can achieve better results compared with its seven competitors.</description><subject>Constrained multi-objective optimization</subject><subject>Evolutionary algorithm</subject><subject>Multi-archives</subject><subject>Two-stage framework</subject><issn>1568-4946</issn><issn>1872-9681</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp9kM1OwzAQhC0EEqXwApz8AgmxnSa2xKWq-JMqcYGztbE3raOkrmy3CJ6eROHMaVfamdHOR8g9K3JWsOqhyyF6k_OClzljTJbFBVkwWfNMVZJdjvuqklmpyuqa3MTYFaNJcbkg3ZqmL5_FBDukePb9KTl_gPBNod_54NJ-oBCjiwktbb7pcOqTyyCYvTtjpK0P1PhDTAHcYVTMZ990aNIooP6Y3OB-YAq9JVct9BHv_uaSfD4_fWxes-37y9tmvc0MX7GUidIyaavWGlGIGhowvAVbqVpaLhpsGQOrpEBVA9TWKEQrOKqyFu1KQN2IJeFzrgk-xoCtPgY3jJU0K_RES3d6oqUnWnqmNZoeZxOOn50dBh2Nw4NB68LYRVvv_rP_Ap1Vd4o</recordid><startdate>202409</startdate><enddate>202409</enddate><creator>Zhang, Wenjuan</creator><creator>Liu, Jianchang</creator><creator>Zhang, Wei</creator><creator>Liu, Yuanchao</creator><creator>Tan, Shubin</creator><general>Elsevier B.V</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-2801-8312</orcidid><orcidid>https://orcid.org/0000-0003-0580-1387</orcidid><orcidid>https://orcid.org/0009-0002-1860-987X</orcidid><orcidid>https://orcid.org/0000-0002-5082-6834</orcidid></search><sort><creationdate>202409</creationdate><title>A two-stage evolutionary algorithm assisted by multi-archives for constrained multi-objective optimization</title><author>Zhang, Wenjuan ; Liu, Jianchang ; Zhang, Wei ; Liu, Yuanchao ; Tan, Shubin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c251t-34d18d6fdc3037abac2fad6978d23bef11ad983e97aa7dc9eed32e9473f53a7b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Constrained multi-objective optimization</topic><topic>Evolutionary algorithm</topic><topic>Multi-archives</topic><topic>Two-stage framework</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhang, Wenjuan</creatorcontrib><creatorcontrib>Liu, Jianchang</creatorcontrib><creatorcontrib>Zhang, Wei</creatorcontrib><creatorcontrib>Liu, Yuanchao</creatorcontrib><creatorcontrib>Tan, Shubin</creatorcontrib><collection>CrossRef</collection><jtitle>Applied soft computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhang, Wenjuan</au><au>Liu, Jianchang</au><au>Zhang, Wei</au><au>Liu, Yuanchao</au><au>Tan, Shubin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A two-stage evolutionary algorithm assisted by multi-archives for constrained multi-objective optimization</atitle><jtitle>Applied soft computing</jtitle><date>2024-09</date><risdate>2024</risdate><volume>162</volume><spage>111840</spage><pages>111840-</pages><artnum>111840</artnum><issn>1568-4946</issn><eissn>1872-9681</eissn><abstract>Due to the widespread existence of constrained multi-objective optimization problems (CMOPs) in real life, many researchers start to research the constrained multi-objective evolutionary algorithms (CMOEAs). Therefore, a variety of CMOEAs have emerged. However, some of them still suffer from great difficulties when coping with CMOPs with complex feasible regions. To solve the issue, this article puts forward a two-stage evolutionary algorithm assisted by multi-archives for constrained multi-objective optimization, called MA-TSEA. In MA-TSEA, the evolution process is divided into two stages. In Stage 1, non-dominated solutions obtained by non-dominated sorting based on (M+1) objectives ( i.e., M objectives and the constraint violation degree (CV) ) are stored in a temporary archive and merged with the parent population to improve the exploration ability of population. Then, MA-TSEA drives the populations to evolve from diverse directions by a multi-objective evolutionary algorithm, while the feasible solutions are saved in a formal archive. Next, the formal archive is updated to improve convergence and diversity. In Stage 2, the main population and archive population cooperate to evolve towards the constrained Pareto front (CPF), where the formal archive and population of Stage 1 are respectively used as the main population and archive population. The experimental studies on five benchmark test suites and five real-world applications demonstrate the superiority of MA-TSEA over the other seven state-of-art CMOEAs. •A MA-TSEA method is develop for CMOPs.•Two stages are used in MA-TSEA with different purposes.•Multiple archives assist the MA-TSEA find the complete constraint Pareto front.•MA-TSEA can achieve better results compared with its seven competitors.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.asoc.2024.111840</doi><orcidid>https://orcid.org/0000-0002-2801-8312</orcidid><orcidid>https://orcid.org/0000-0003-0580-1387</orcidid><orcidid>https://orcid.org/0009-0002-1860-987X</orcidid><orcidid>https://orcid.org/0000-0002-5082-6834</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 1568-4946
ispartof Applied soft computing, 2024-09, Vol.162, p.111840, Article 111840
issn 1568-4946
1872-9681
language eng
recordid cdi_crossref_primary_10_1016_j_asoc_2024_111840
source ScienceDirect Freedom Collection
subjects Constrained multi-objective optimization
Evolutionary algorithm
Multi-archives
Two-stage framework
title A two-stage evolutionary algorithm assisted by multi-archives for constrained multi-objective optimization
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-25T11%3A04%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20two-stage%20evolutionary%20algorithm%20assisted%20by%20multi-archives%20for%20constrained%20multi-objective%20optimization&rft.jtitle=Applied%20soft%20computing&rft.au=Zhang,%20Wenjuan&rft.date=2024-09&rft.volume=162&rft.spage=111840&rft.pages=111840-&rft.artnum=111840&rft.issn=1568-4946&rft.eissn=1872-9681&rft_id=info:doi/10.1016/j.asoc.2024.111840&rft_dat=%3Celsevier_cross%3ES1568494624006148%3C/elsevier_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c251t-34d18d6fdc3037abac2fad6978d23bef11ad983e97aa7dc9eed32e9473f53a7b3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true