A Constrained Multiobjective Evolutionary Algorithm With Detect-and-Escape Strategy
Overall constraint violation functions are commonly used in multiobjective evolutionary algorithms (MOEAs) for handling constraints. Constraints could cause these algorithms stuck in two stagnation states: 1) since the feasible region of a multiobjective optimization problem can consist of several d...
Uložené v:
| Vydané v: | IEEE transactions on evolutionary computation Ročník 24; číslo 5; s. 938 - 947 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
IEEE
01.10.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Predmet: | |
| ISSN: | 1089-778X, 1941-0026 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Overall constraint violation functions are commonly used in multiobjective evolutionary algorithms (MOEAs) for handling constraints. Constraints could cause these algorithms stuck in two stagnation states: 1) since the feasible region of a multiobjective optimization problem can consist of several disconnected feasible subregions, the search can be easily trapped in a feasible subregion which does not contain all the global Pareto optimal solutions and 2) an overall constraint violation function may have many nonzero minimal points, it can make the search stuck in an unfeasible area. To address these two issues, this article proposes a strategy to detect whether or not the search is stuck in these two stagnation states and then escape from them. Our proposed detect-and-escape strategy uses the feasible ratio and the change rate of overall constraint violation to detect stagnation, and adjusts the weight of the constraint violation for guiding the search to escape from stagnation states. We develop and implement a decomposition-based constrained MOEA with this strategy. Extensive experiments on a number of benchmark problems demonstrate the competitiveness of our proposed algorithm when compared to five other state-of-the-art constrained evolutionary algorithms. |
|---|---|
| AbstractList | Overall constraint violation functions are commonly used in multiobjective evolutionary algorithms (MOEAs) for handling constraints. Constraints could cause these algorithms stuck in two stagnation states: 1) since the feasible region of a multiobjective optimization problem can consist of several disconnected feasible subregions, the search can be easily trapped in a feasible subregion which does not contain all the global Pareto optimal solutions and 2) an overall constraint violation function may have many nonzero minimal points, it can make the search stuck in an unfeasible area. To address these two issues, this article proposes a strategy to detect whether or not the search is stuck in these two stagnation states and then escape from them. Our proposed detect-and-escape strategy uses the feasible ratio and the change rate of overall constraint violation to detect stagnation, and adjusts the weight of the constraint violation for guiding the search to escape from stagnation states. We develop and implement a decomposition-based constrained MOEA with this strategy. Extensive experiments on a number of benchmark problems demonstrate the competitiveness of our proposed algorithm when compared to five other state-of-the-art constrained evolutionary algorithms. |
| Author | Zhang, Qingfu Zhu, Qingling Lin, Qiuzhen |
| Author_xml | – sequence: 1 givenname: Qingling orcidid: 0000-0002-0228-8226 surname: Zhu fullname: Zhu, Qingling email: qlzhu4-c@my.cityu.edu.hk organization: Department of Computer Science, City University of Hong Kong, Hong Kong – sequence: 2 givenname: Qingfu surname: Zhang fullname: Zhang, Qingfu email: qingfu.zhang@cityu.edu.hk organization: Department of Computer Science, City University of Hong Kong, Hong Kong – sequence: 3 givenname: Qiuzhen orcidid: 0000-0003-2415-0401 surname: Lin fullname: Lin, Qiuzhen email: qiuzhlin@szu.edu.cn organization: College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China |
| BookMark | eNp9kD1PwzAQhi1UJNrCD0AskZhTbMeO47EK5UMqYmj52CzHPZdUaVJip1L_PY5aMTCw3J2s5z3rnhEa1E0NCF0TPCEEy7vl7D2fUEzxhMqMSCbP0DA0EmNM00GYcSZjIbLPCzRyboMxYZzIIVpMo7ypnW91WcMqeukqXzbFBowv9xDN9k3VhYdat4doWq2btvRf2-gj1OgefKBiXa_imTN6B9EibPGwPlyic6srB1enPkZvD7Nl_hTPXx-f8-k8NlQmPl5hkTDAKWE2NTyRBac8SY0BLrUFUcg01SCsLYqUUxC4YBI0NpZwSgFrm4zR7XHvrm2-O3BebZqurcOXijImeOBYEihxpEzbONeCVab0uj-qP7pSBKveoOoNqt6gOhkMSfInuWvLbVDxb-bmmCkB4JeXmNGMk-QHMTR_FQ |
| CODEN | ITEVF5 |
| CitedBy_id | crossref_primary_10_1016_j_ins_2024_120879 crossref_primary_10_1016_j_knosys_2022_108732 crossref_primary_10_1016_j_swevo_2025_102055 crossref_primary_10_1038_s41598_025_06385_z crossref_primary_10_1109_TCYB_2022_3178132 crossref_primary_10_1109_TEVC_2022_3166815 crossref_primary_10_1109_TEVC_2023_3345470 crossref_primary_10_1007_s10489_022_03421_7 crossref_primary_10_1016_j_asoc_2022_108481 crossref_primary_10_1016_j_swevo_2021_100940 crossref_primary_10_1109_TEVC_2022_3186667 crossref_primary_10_1016_j_engappai_2024_108673 crossref_primary_10_1109_TAI_2024_3454025 crossref_primary_10_1109_TCYB_2025_3531449 crossref_primary_10_1016_j_asoc_2024_111800 crossref_primary_10_1049_gtd2_12664 crossref_primary_10_1177_00202940241276279 crossref_primary_10_1016_j_ymssp_2024_111251 crossref_primary_10_1109_JAS_2024_124545 crossref_primary_10_1016_j_eswa_2023_122492 crossref_primary_10_1016_j_knosys_2023_110801 crossref_primary_10_1016_j_swevo_2023_101372 crossref_primary_10_1109_TEVC_2023_3281666 crossref_primary_10_1007_s40747_025_01819_7 crossref_primary_10_1016_j_knosys_2021_107933 crossref_primary_10_3390_math13091441 crossref_primary_10_1016_j_ins_2023_119654 crossref_primary_10_1016_j_eswa_2023_121718 crossref_primary_10_1007_s40747_025_01846_4 crossref_primary_10_1109_TCYB_2022_3151974 crossref_primary_10_1016_j_swevo_2023_101404 crossref_primary_10_1016_j_swevo_2024_101746 crossref_primary_10_3390_axioms12020100 crossref_primary_10_1016_j_asoc_2023_110446 crossref_primary_10_1109_TETCI_2024_3393368 crossref_primary_10_1016_j_asoc_2023_110845 crossref_primary_10_1016_j_geoen_2025_213647 crossref_primary_10_1109_TEVC_2022_3155533 crossref_primary_10_3390_math10234459 crossref_primary_10_1016_j_swevo_2022_101104 crossref_primary_10_1007_s40747_024_01542_9 crossref_primary_10_1016_j_ejor_2025_07_002 crossref_primary_10_1016_j_swevo_2025_102030 crossref_primary_10_1109_TCYB_2021_3086501 crossref_primary_10_1016_j_ins_2023_119467 crossref_primary_10_1016_j_ins_2023_119906 crossref_primary_10_1109_MCI_2023_3245719 crossref_primary_10_1016_j_asoc_2025_113895 crossref_primary_10_1016_j_knosys_2021_107263 crossref_primary_10_1007_s10489_022_03874_w crossref_primary_10_1016_j_eswa_2025_126908 crossref_primary_10_1109_TEVC_2024_3376729 crossref_primary_10_1016_j_swevo_2023_101417 crossref_primary_10_1007_s12667_022_00549_w crossref_primary_10_1109_TEVC_2023_3241762 crossref_primary_10_1109_TEVC_2022_3208595 crossref_primary_10_1109_TEVC_2024_3366659 crossref_primary_10_1016_j_swevo_2022_101098 crossref_primary_10_1007_s11831_022_09859_9 crossref_primary_10_1109_TSMC_2021_3061698 crossref_primary_10_1016_j_ins_2024_121836 crossref_primary_10_1016_j_swevo_2025_102044 crossref_primary_10_1109_TCYB_2020_3031642 crossref_primary_10_1007_s10489_022_03990_7 crossref_primary_10_1007_s44336_024_00006_5 crossref_primary_10_1016_j_asoc_2025_113658 crossref_primary_10_1016_j_swevo_2024_101728 crossref_primary_10_1016_j_asoc_2024_112545 crossref_primary_10_1016_j_swevo_2021_100932 crossref_primary_10_1080_01605682_2025_2479136 crossref_primary_10_1016_j_asoc_2024_112428 crossref_primary_10_1016_j_swevo_2024_101727 crossref_primary_10_1016_j_ins_2025_121985 crossref_primary_10_1109_TETCI_2025_3529882 crossref_primary_10_1109_TEVC_2022_3190401 crossref_primary_10_1016_j_ins_2023_119593 crossref_primary_10_3390_sym14010116 crossref_primary_10_1016_j_eswa_2023_122872 crossref_primary_10_1016_j_swevo_2024_101683 crossref_primary_10_1109_TEVC_2022_3194729 crossref_primary_10_1016_j_engappai_2023_107290 crossref_primary_10_1016_j_ins_2025_122559 crossref_primary_10_1016_j_swevo_2024_101685 crossref_primary_10_1109_TAI_2024_3391230 crossref_primary_10_1002_tee_24200 crossref_primary_10_1109_JAS_2023_123687 crossref_primary_10_1016_j_knosys_2022_109105 crossref_primary_10_1109_ACCESS_2024_3475032 crossref_primary_10_1109_TEVC_2022_3230822 crossref_primary_10_1109_TEVC_2022_3199775 crossref_primary_10_1109_TCYB_2022_3163759 crossref_primary_10_1016_j_swevo_2022_101161 crossref_primary_10_1080_0305215X_2025_2464861 crossref_primary_10_1109_TEVC_2023_3349073 crossref_primary_10_1016_j_swevo_2024_101717 crossref_primary_10_1016_j_asoc_2023_110874 crossref_primary_10_1109_TEVC_2023_3294307 crossref_primary_10_3390_rs13101968 crossref_primary_10_1016_j_swevo_2023_101432 crossref_primary_10_1016_j_swevo_2025_101954 crossref_primary_10_1007_s40747_022_00851_1 crossref_primary_10_1016_j_eswa_2023_122961 crossref_primary_10_1016_j_ins_2024_121812 crossref_primary_10_1007_s10586_024_05035_9 crossref_primary_10_1109_TEVC_2020_3047835 crossref_primary_10_1109_ACCESS_2023_3300590 crossref_primary_10_3390_app15073651 crossref_primary_10_1016_j_ins_2022_03_030 crossref_primary_10_1109_TEVC_2022_3145582 crossref_primary_10_3390_math12243926 crossref_primary_10_1109_TCYB_2021_3069814 crossref_primary_10_1007_s12293_024_00409_3 crossref_primary_10_1016_j_asoc_2024_111674 crossref_primary_10_1016_j_asoc_2024_111398 crossref_primary_10_1016_j_asoc_2025_112825 crossref_primary_10_1109_TETCI_2023_3236633 crossref_primary_10_1016_j_ins_2021_07_078 crossref_primary_10_1007_s00521_024_09787_8 crossref_primary_10_1016_j_asoc_2024_112128 crossref_primary_10_1016_j_ins_2023_119572 crossref_primary_10_1007_s13369_025_10149_2 crossref_primary_10_1016_j_eswa_2024_126073 crossref_primary_10_1016_j_knosys_2022_110112 crossref_primary_10_1109_TEVC_2024_3425629 crossref_primary_10_1016_j_ins_2022_05_106 crossref_primary_10_1016_j_ins_2024_121700 crossref_primary_10_1016_j_swevo_2025_102017 crossref_primary_10_1109_TSMC_2025_3547618 crossref_primary_10_1016_j_ins_2023_119547 crossref_primary_10_1016_j_swevo_2025_102111 crossref_primary_10_1109_TSMC_2023_3299570 crossref_primary_10_1016_j_ins_2023_03_023 crossref_primary_10_1109_TEVC_2022_3175065 crossref_primary_10_1109_TCYB_2022_3151793 crossref_primary_10_1007_s12293_023_00393_0 crossref_primary_10_1109_TEVC_2023_3270483 crossref_primary_10_1016_j_ins_2021_07_048 crossref_primary_10_1016_j_swevo_2024_101819 crossref_primary_10_1007_s12293_022_00360_1 crossref_primary_10_1016_j_displa_2025_103206 crossref_primary_10_1016_j_asoc_2024_112516 crossref_primary_10_1016_j_swevo_2025_101937 crossref_primary_10_1016_j_swevo_2022_101178 crossref_primary_10_1016_j_swevo_2025_101933 crossref_primary_10_1109_TETCI_2024_3359517 crossref_primary_10_1016_j_swevo_2022_101055 crossref_primary_10_1016_j_swevo_2024_101657 crossref_primary_10_1109_TEVC_2022_3224600 crossref_primary_10_1007_s40815_021_01220_9 crossref_primary_10_1016_j_ins_2023_119260 crossref_primary_10_1016_j_swevo_2024_101496 crossref_primary_10_1016_j_neucom_2024_129296 crossref_primary_10_1016_j_swevo_2021_101013 crossref_primary_10_1016_j_knosys_2025_113991 crossref_primary_10_1109_TNNLS_2023_3297624 crossref_primary_10_1109_TETCI_2022_3221940 crossref_primary_10_1109_TEVC_2022_3194253 crossref_primary_10_1007_s00170_023_12268_2 crossref_primary_10_1109_TEVC_2022_3202723 crossref_primary_10_1109_JIOT_2021_3067732 crossref_primary_10_3390_pr13082484 crossref_primary_10_3390_s23062984 crossref_primary_10_1016_j_ins_2024_121081 crossref_primary_10_1016_j_eswa_2022_116499 crossref_primary_10_1016_j_asoc_2024_112226 crossref_primary_10_1016_j_asoc_2025_113216 crossref_primary_10_1016_j_swevo_2021_100978 crossref_primary_10_1016_j_swevo_2024_101648 crossref_primary_10_1016_j_swevo_2022_101209 crossref_primary_10_1016_j_ins_2022_10_046 crossref_primary_10_1016_j_ins_2024_121648 |
| Cites_doi | 10.1016/j.swevo.2018.08.017 10.1109/4235.797969 10.1109/TEVC.2019.2896967 10.1109/4235.996017 10.1109/TEVC.2018.2855411 10.1109/TPWRS.2017.2785266 10.1137/S1052623496307510 10.1109/CEC.2012.6252868 10.1109/TEVC.2007.892759 10.1145/2598394.2610012 10.1109/TCYB.2019.2928174 10.1109/TEVC.2019.2904900 10.1109/SSCI.2016.7850224 10.1109/TEVC.2015.2504730 10.1016/j.asoc.2017.06.053 10.1109/TEVC.2019.2894743 10.1016/j.asoc.2012.07.027 10.1109/TEVC.2003.810761 10.1109/TEVC.2008.2009032 10.1023/A:1008202821328 10.1109/TEVC.2019.2933444 10.1007/3-540-44719-9_20 10.1016/j.asoc.2018.10.027 10.1109/TEVC.2019.2922419 10.1109/AIMS.2013.16 10.1109/TEVC.2013.2281534 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020 |
| DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/TEVC.2020.2981949 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Statistics Computer Science |
| EISSN | 1941-0026 |
| EndPage | 947 |
| ExternalDocumentID | 10_1109_TEVC_2020_2981949 9042851 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China grantid: 61876163 funderid: 10.13039/501100001809 – fundername: ANR/RGC Joint Research Scheme Sponsored by the Research Grants Council of the Hong Kong Special Administrative Region, China and France National Research Agency Under Project grantid: A-CityU101/16 |
| GroupedDBID | -~X .DC 0R~ 29I 4.4 5GY 5VS 6IF 6IK 6IL 6IN 97E AAJGR AARMG AASAJ AAWTH ABAZT ABJNI ABQJQ ABVLG ACGFO ACGFS ACIWK ADZIZ AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CHZPO CS3 EBS EJD HZ~ H~9 IEGSK IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P PQQKQ RIA RIE RIL RNS TN5 VH1 AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c293t-d0734e0614f6c539b52536cce59afe7b966ae7ffbb652e70b49ea0cf1522e0af3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 196 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000574741600010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1089-778X |
| IngestDate | Mon Jun 30 04:37:16 EDT 2025 Tue Nov 18 22:24:33 EST 2025 Sat Nov 29 03:13:48 EST 2025 Wed Aug 27 02:31:56 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c293t-d0734e0614f6c539b52536cce59afe7b966ae7ffbb652e70b49ea0cf1522e0af3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0003-2415-0401 0000-0002-0228-8226 |
| PQID | 2447552243 |
| PQPubID | 85418 |
| PageCount | 10 |
| ParticipantIDs | proquest_journals_2447552243 ieee_primary_9042851 crossref_citationtrail_10_1109_TEVC_2020_2981949 crossref_primary_10_1109_TEVC_2020_2981949 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-10-01 |
| PublicationDateYYYYMMDD | 2020-10-01 |
| PublicationDate_xml | – month: 10 year: 2020 text: 2020-10-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on evolutionary computation |
| PublicationTitleAbbrev | TEVC |
| PublicationYear | 2020 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref34 ref12 ref15 ref30 ref33 ref32 ref10 ref2 jan (ref19) 2010 ref1 ref17 ref18 jan (ref20) 2016; 7 zhang (ref31) 2008 ref24 ref23 ref26 ref25 takahama (ref11) 2006 ref22 ref21 ref27 ref29 michalewicz (ref5) 1995; 4 miettinen (ref14) 1999; 12 ref8 ref7 ref9 ref4 ref3 ref6 trivedi (ref16) 2017; 21 hoos (ref28) 2004 |
| References_xml | – ident: ref13 doi: 10.1016/j.swevo.2018.08.017 – volume: 12 year: 1999 ident: ref14 publication-title: Nonlinear Multiobjective Optimization – ident: ref34 doi: 10.1109/4235.797969 – year: 2008 ident: ref31 article-title: Multiobjective optimization test instances for the CEC 2009 special session and competition – ident: ref10 doi: 10.1109/TEVC.2019.2896967 – ident: ref29 doi: 10.1109/4235.996017 – ident: ref12 doi: 10.1109/TEVC.2018.2855411 – ident: ref1 doi: 10.1109/TPWRS.2017.2785266 – ident: ref15 doi: 10.1137/S1052623496307510 – ident: ref26 doi: 10.1109/CEC.2012.6252868 – ident: ref27 doi: 10.1109/TEVC.2007.892759 – volume: 7 start-page: 645 year: 2016 ident: ref20 article-title: A new threshold based penalty function embedded MOEA/D publication-title: Int J Adv Comput Sci Appl – ident: ref21 doi: 10.1145/2598394.2610012 – ident: ref3 doi: 10.1109/TCYB.2019.2928174 – ident: ref9 doi: 10.1109/TEVC.2019.2904900 – ident: ref22 doi: 10.1109/SSCI.2016.7850224 – ident: ref30 doi: 10.1109/TEVC.2015.2504730 – start-page: 1 year: 2006 ident: ref11 article-title: Constrained optimization by the ? constrained differential evolution with gradient-based mutation and feasible elites publication-title: Proc IEEE Int Conf Evol Comput – ident: ref24 doi: 10.1016/j.asoc.2017.06.053 – volume: 4 start-page: 135 year: 1995 ident: ref5 article-title: A survey of constraint handling techniques in evolutionary computation methods publication-title: Proc 4th Annu Conf Evol Program – ident: ref8 doi: 10.1109/TEVC.2019.2894743 – ident: ref17 doi: 10.1016/j.asoc.2012.07.027 – ident: ref33 doi: 10.1109/TEVC.2003.810761 – volume: 21 start-page: 440 year: 2017 ident: ref16 article-title: A survey of multiobjective evolutionary algorithms based on decomposition publication-title: IEEE Trans Evol Comput – ident: ref6 doi: 10.1109/TEVC.2008.2009032 – year: 2004 ident: ref28 publication-title: Stochastic Local Search Foundations and Applications – ident: ref23 doi: 10.1023/A:1008202821328 – ident: ref4 doi: 10.1109/TEVC.2019.2933444 – ident: ref32 doi: 10.1007/3-540-44719-9_20 – ident: ref18 doi: 10.1016/j.asoc.2018.10.027 – ident: ref2 doi: 10.1109/TEVC.2019.2922419 – ident: ref25 doi: 10.1109/AIMS.2013.16 – start-page: 1 year: 2010 ident: ref19 article-title: MOEA/D for constrained multiobjective optimization: Some preliminary experimental results publication-title: Proc IEEE U K Workshop Comput Intell (U K CI) – ident: ref7 doi: 10.1109/TEVC.2013.2281534 |
| SSID | ssj0014519 |
| Score | 2.660358 |
| Snippet | Overall constraint violation functions are commonly used in multiobjective evolutionary algorithms (MOEAs) for handling constraints. Constraints could cause... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 938 |
| SubjectTerms | Constraint handling Constraint handling technique (CHT) Constraints Evolutionary algorithms Evolutionary computation Genetic algorithms MOEA/D multiobjective optimization Multiple objective analysis Optimization Pareto optimization Searching Sociology Stagnation Statistics Strategy Urban areas |
| Title | A Constrained Multiobjective Evolutionary Algorithm With Detect-and-Escape Strategy |
| URI | https://ieeexplore.ieee.org/document/9042851 https://www.proquest.com/docview/2447552243 |
| Volume | 24 |
| WOSCitedRecordID | wos000574741600010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1941-0026 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014519 issn: 1089-778X databaseCode: RIE dateStart: 19970101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDLYAcRgHHhuI8VIOnBDZuiZtluMEmzgghASM3aomTXhorGgMJP49cZpNSCAkLlUPSdX0i2O7tj8DHDuHi_E0lpQlmlMeR4bmTi1TVTCrubBc-tyc4aW4uuqORvJ6CU4XtTDGGJ98Zlp462P5Ranf8VdZW6KBj_XSy0KkVa3WImKANClVMr10FmN3FCKYnUi2b_vDM-cJxlErlk4BIm3mNx3km6r8OIm9ehls_O_FNmE9mJGkV-G-BUtmUoeNeYsGEiS2Dmvf-AbrUEPTsmJmbsBNj2C3Tt8jwhTEV-KW6rk6AEn_I-zJfPpJeuOHcvo0e3wh9-5Kzg1GHmg-KWj_DROoSOC4_dyGu0H_9uyChhYLVDs9P6OFk3Bu0Cu0qU6YVEmcsFRjbVZujVDOGcqNsFapNImNiBSXJo-0dVo_NlFu2Q6sTMqJ2QXSFYox6Qy6TlfyQmhVYHNdiyaUc5p4pwnR_KNnOvCP4xLHmfdDIpkhThnilAWcmnCymPJakW_8NbiBwCwGBkyacDBHNgvi-ZbFSHPolsDZ3u-z9qGGz66y9g5gZTZ9N4ewqj8cSNMjv_O-AFm11Kk |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED-GCuqDH1NxOjUPPonRrknX5XHoRHEOwal7K02a-MHcZF-w_95cmg1BEXwpfUjapr8kd5e7-x3AsTW4GK-GgrJIccrDQNPUimUqM2YUjw0XLjbnqRm3WrVOR9wX4HSeC6O1dsFn-gxvnS8_66sxHpWdC1TwMV96MeL2sXm21txngEQpeTi9sDpjreN9mJVAnLcbTxfWFgyDs1BYEYjEmd-kkCur8mMvdgLmav1_n7YBa16RJPUc-U0o6F4R1mdFGohfs0VY_cY4WIQVVC5zbuYteKgTrNfpqkTojLhc3L58z7dA0pj4WZkOpqTefekP3kavH-TZXsmlRt8DTXsZbQwxhIp4ltvpNjxeNdoX19QXWaDKSvoRzewa5xrtQlNVERMyCiNWVZidlRodS2sOpTo2RspqFOo4kFzoNFDGyv1QB6lhO7DQ6_f0LpBaLBkTVqWr1ATPYiUzLK9rUImyZhOvlCCY_fREeQZyHGI3cZZIIBLEKUGcEo9TCU7mXT5z-o2_Gm8hMPOGHpMSlGfIJn6BDpMQiQ7tEDjb-73XESxft--aSfOmdbsPK_iePIavDAujwVgfwJKaWMAGh24WfgGRuNfw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Constrained+Multiobjective+Evolutionary+Algorithm+With+Detect-and-Escape+Strategy&rft.jtitle=IEEE+transactions+on+evolutionary+computation&rft.au=Zhu%2C+Qingling&rft.au=Zhang%2C+Qingfu&rft.au=Lin%2C+Qiuzhen&rft.date=2020-10-01&rft.pub=IEEE&rft.issn=1089-778X&rft.volume=24&rft.issue=5&rft.spage=938&rft.epage=947&rft_id=info:doi/10.1109%2FTEVC.2020.2981949&rft.externalDocID=9042851 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1089-778X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1089-778X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1089-778X&client=summon |