A Framework to Handle Multimodal Multiobjective Optimization in Decomposition-Based Evolutionary Algorithms

Multimodal multiobjective optimization is to locate (almost) equivalent Pareto optimal solutions as many as possible. While decomposition-based evolutionary algorithms have good performance for multiobjective optimization, they are likely to perform poorly for multimodal multiobjective optimization...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on evolutionary computation Ročník 24; číslo 4; s. 720 - 734
Hlavní autori: Tanabe, Ryoji, Ishibuchi, Hisao
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.08.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 Multimodal multiobjective optimization is to locate (almost) equivalent Pareto optimal solutions as many as possible. While decomposition-based evolutionary algorithms have good performance for multiobjective optimization, they are likely to perform poorly for multimodal multiobjective optimization due to the lack of mechanisms to maintain the solution space diversity. To address this issue, this article proposes a framework to improve the performance of decomposition-based evolutionary algorithms for multimodal multiobjective optimization. Our framework is based on three operations: 1) assignment; 2) deletion; and 3) addition operations. One or more individuals can be assigned to the same subproblem to handle multiple equivalent solutions. In each iteration, a child is assigned to a subproblem based on its objective vector, i.e., its location in the objective space. The child is compared with its neighbors in the solution space assigned to the same subproblem. The performance of improved versions of six decomposition-based evolutionary algorithms by our framework is evaluated on various test problems regarding the number of objectives, decision variables, and equivalent Pareto optimal solution sets. Results show that the improved versions perform clearly better than their original algorithms.
AbstractList Multimodal multiobjective optimization is to locate (almost) equivalent Pareto optimal solutions as many as possible. While decomposition-based evolutionary algorithms have good performance for multiobjective optimization, they are likely to perform poorly for multimodal multiobjective optimization due to the lack of mechanisms to maintain the solution space diversity. To address this issue, this article proposes a framework to improve the performance of decomposition-based evolutionary algorithms for multimodal multiobjective optimization. Our framework is based on three operations: 1) assignment; 2) deletion; and 3) addition operations. One or more individuals can be assigned to the same subproblem to handle multiple equivalent solutions. In each iteration, a child is assigned to a subproblem based on its objective vector, i.e., its location in the objective space. The child is compared with its neighbors in the solution space assigned to the same subproblem. The performance of improved versions of six decomposition-based evolutionary algorithms by our framework is evaluated on various test problems regarding the number of objectives, decision variables, and equivalent Pareto optimal solution sets. Results show that the improved versions perform clearly better than their original algorithms.
Author Tanabe, Ryoji
Ishibuchi, Hisao
Author_xml – sequence: 1
  givenname: Ryoji
  orcidid: 0000-0003-4049-0393
  surname: Tanabe
  fullname: Tanabe, Ryoji
  email: rt.ryoji.tanabe@gmail.com
  organization: Department of Computer Science and Engineering, Shenzhen Key Laboratory of Computational Intelligence, University Key Laboratory of Evolving Intelligent Systems of Guangdong Province, Southern University of Science and Technology, Shenzhen, China
– sequence: 2
  givenname: Hisao
  orcidid: 0000-0001-9186-6472
  surname: Ishibuchi
  fullname: Ishibuchi, Hisao
  email: hisao@sustech.edu.cn
  organization: Department of Computer Science and Engineering, Shenzhen Key Laboratory of Computational Intelligence, University Key Laboratory of Evolving Intelligent Systems of Guangdong Province, Southern University of Science and Technology, Shenzhen, China
BookMark eNp9UMtOwzAQtBBIPD8AcbHEOcWPxI6PpbSAVNQLIG6RnW7AJYmDnRTB15MQxIEDp52dndnVziHarV0NCJ1SMqGUqIv7-eNswghVE6ZilcZ0Bx1QFdOIECZ2e0xSFUmZPu2jwxA2hNA4oeoAvU7xwusK3p1_xa3DN7pel4DvurK1lVvrcoTObCBv7RbwqukH9lP3XI1tja8gd1Xjgh2I6FIHWOP51pXd0Gv_gafls_O2fanCMdordBng5KceoYfF_H52Ey1X17ez6TLKeaLaiMdAC8m5EbQwQjAJIhFrLRKT5EZyoxk1Mk9NXOSFAGOYNDyBlMtez5NE8yN0Pu5tvHvrILTZxnW-7k9mLGaKqVQw0qvkqMq9C8FDkeW2_X6r9dqWGSXZkGw2JJsNyWY_yfZO-sfZeFv1v_7rORs9FgB-9Wk6zCj_Akm4iIE
CODEN ITEVF5
CitedBy_id crossref_primary_10_1016_j_ins_2024_120879
crossref_primary_10_1016_j_swevo_2019_06_001
crossref_primary_10_1109_TGRS_2023_3327279
crossref_primary_10_26599_TST_2023_9010031
crossref_primary_10_32604_cmc_2024_050430
crossref_primary_10_1016_j_swevo_2024_101480
crossref_primary_10_1007_s12293_024_00410_w
crossref_primary_10_1016_j_asoc_2023_110360
crossref_primary_10_1016_j_swevo_2021_100908
crossref_primary_10_1007_s12293_024_00413_7
crossref_primary_10_1109_TEVC_2022_3217258
crossref_primary_10_1109_TSMC_2023_3325810
crossref_primary_10_1016_j_swevo_2023_101431
crossref_primary_10_1016_j_swevo_2023_101397
crossref_primary_10_1016_j_swevo_2025_101952
crossref_primary_10_1016_j_swevo_2023_101352
crossref_primary_10_1007_s00521_021_05786_1
crossref_primary_10_1016_j_swevo_2025_101951
crossref_primary_10_1007_s10489_021_02969_0
crossref_primary_10_1016_j_swevo_2025_102068
crossref_primary_10_1109_TSMC_2022_3171549
crossref_primary_10_1016_j_ins_2023_02_019
crossref_primary_10_1109_TCYB_2021_3108977
crossref_primary_10_1007_s10586_025_05352_7
crossref_primary_10_1016_j_asoc_2024_111954
crossref_primary_10_1016_j_swevo_2024_101826
crossref_primary_10_1007_s00521_023_09018_6
crossref_primary_10_1016_j_eswa_2025_127862
crossref_primary_10_1016_j_swevo_2024_101541
crossref_primary_10_7717_peerj_cs_2182
crossref_primary_10_1016_j_ins_2022_05_075
crossref_primary_10_1016_j_swevo_2021_100849
crossref_primary_10_1109_TEVC_2020_3044711
crossref_primary_10_1016_j_swevo_2021_100842
crossref_primary_10_1109_TEVC_2020_3008822
crossref_primary_10_1007_s11633_022_1314_7
crossref_primary_10_1016_j_ins_2023_119860
crossref_primary_10_1016_j_swevo_2024_101652
crossref_primary_10_1016_j_swevo_2024_101691
crossref_primary_10_1109_TETCI_2022_3221940
crossref_primary_10_1109_TCSS_2021_3061439
crossref_primary_10_1016_j_knosys_2023_110708
crossref_primary_10_1016_j_swevo_2021_100976
crossref_primary_10_1016_j_ins_2021_07_011
crossref_primary_10_1016_j_asoc_2025_113853
crossref_primary_10_1016_j_swevo_2022_101209
crossref_primary_10_1109_TGRS_2025_3528015
crossref_primary_10_1007_s00521_023_09110_x
crossref_primary_10_1016_j_knosys_2023_110398
crossref_primary_10_1016_j_ins_2023_119750
crossref_primary_10_1016_j_ins_2023_119794
crossref_primary_10_1016_j_ins_2023_119271
crossref_primary_10_1016_j_engappai_2024_108040
crossref_primary_10_1016_j_asoc_2021_107981
crossref_primary_10_1016_j_ins_2024_120999
crossref_primary_10_1109_TEVC_2022_3155757
Cites_doi 10.1109/TEVC.2016.2638437
10.1109/TEVC.2015.2443001
10.1007/978-3-642-15844-5_71
10.1109/CEC.2016.7743917
10.1109/TCYB.2015.2403849
10.1109/CEC.2019.8789971
10.1109/TEVC.2016.2587808
10.1007/978-3-540-70928-2_7
10.1007/978-3-319-45823-6_90
10.1007/978-3-642-29178-4_39
10.1007/978-3-642-01020-0_12
10.2514/1.46478
10.1109/ACCESS.2017.2751071
10.1016/j.advengsoft.2011.05.014
10.1109/TEVC.2013.2281535
10.1145/3205651.3208224
10.1109/MCDM.2009.4938831
10.1162/EVCO_a_00009
10.1109/4235.996017
10.1109/TEVC.2017.2707980
10.1145/3067695.3082527
10.1109/TEVC.2018.2879406
10.1109/TEVC.2015.2420112
10.1109/TEVC.2013.2293776
10.1109/CEC.2009.4982949
10.1007/978-3-319-15892-1_8
10.1109/TEVC.2009.2021467
10.1109/TEVC.2016.2587749
10.1007/978-3-319-99253-2_20
10.1109/TEVC.2007.892759
10.1007/978-3-540-30217-9_84
10.1016/j.ejor.2006.06.042
10.1109/TEVC.2016.2592479
10.1109/TEVC.2014.2350987
10.1109/TEVC.2017.2754271
10.1007/978-3-540-31880-4_4
10.1109/TEVC.2018.2883094
10.1109/TEVC.2016.2519378
10.1007/s00500-017-2965-0
10.1109/CEC.2011.5949936
10.1145/2576768.2598276
10.1109/TEVC.2008.925798
10.1109/CEC.2016.7744093
10.1023/A:1008202821328
10.1109/TEVC.2015.2455812
10.1145/1143997.1143999
10.1142/S1469026817500067
10.1109/TEVC.2014.2339823
10.1162/EVCO_a_00109
10.1109/CEC.2005.1554690
10.1007/11844297_52
10.1145/1830483.1830569
10.1007/978-1-4615-5563-6
10.1007/978-3-642-15871-1_10
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.2019.2949841
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
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
Computer Science
EISSN 1941-0026
EndPage 734
ExternalDocumentID 10_1109_TEVC_2019_2949841
8884131
Genre orig-research
GrantInformation_xml – fundername: Science and Technology Innovation Committee Foundation of Shenzhen
  grantid: ZDSYS201703031748284
– fundername: Program for Guangdong Introducing Innovative and Enterpreneurial Teams
  grantid: 2017ZT07X386
– fundername: Program for University Key Laboratory of Guangdong Province
  grantid: 2017KSYS008
  funderid: 10.13039/100016094
– fundername: National Natural Science Foundation of China
  grantid: 61876075
  funderid: 10.13039/501100001809
– fundername: Shenzhen Peacock Plan
  grantid: KQTD2016112514355531
  funderid: 10.13039/501100012234
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-c359t-34e1f733b61fb6627e656da65b5cb73ba21b7c8b4fcf6ebb27b35e83761f355a3
IEDL.DBID RIE
ISICitedReferencesCount 64
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000554887000008&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 Sun Nov 30 04:20:48 EST 2025
Sat Nov 29 03:13:48 EST 2025
Tue Nov 18 22:22:13 EST 2025
Wed Aug 27 02:33:56 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 4
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-c359t-34e1f733b61fb6627e656da65b5cb73ba21b7c8b4fcf6ebb27b35e83761f355a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-9186-6472
0000-0003-4049-0393
PQID 2429298620
PQPubID 85418
PageCount 15
ParticipantIDs crossref_citationtrail_10_1109_TEVC_2019_2949841
proquest_journals_2429298620
ieee_primary_8884131
crossref_primary_10_1109_TEVC_2019_2949841
PublicationCentury 2000
PublicationDate 2020-08-01
PublicationDateYYYYMMDD 2020-08-01
PublicationDate_xml – month: 08
  year: 2020
  text: 2020-08-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 ref57
ref13
ref56
ref12
ref59
ref15
ref58
ref14
ref53
ref52
ref55
ref54
ref10
ref17
ref16
ref19
ref18
ref51
ref50
preuss (ref11) 2008
ref46
ref48
ref47
ref42
ref41
ref44
ref49
ref8
li (ref45) 2014; 18
ref9
ref4
ref3
ref5
ref40
ref35
ref34
ref37
ref36
ref31
ref30
ref33
ref32
ref2
ref1
ref39
ref38
deb (ref27) 1995; 9
coello coello (ref43) 2004
trivedi (ref6) 2017; 21
ref24
ref23
ref26
ref25
sebag (ref7) 2005
ref20
ref22
ref21
ref28
ref29
References_xml – ident: ref34
  doi: 10.1109/TEVC.2016.2638437
– ident: ref20
  doi: 10.1109/TEVC.2015.2443001
– ident: ref14
  doi: 10.1007/978-3-642-15844-5_71
– ident: ref41
  doi: 10.1109/CEC.2016.7743917
– ident: ref19
  doi: 10.1109/TCYB.2015.2403849
– ident: ref57
  doi: 10.1109/CEC.2019.8789971
– ident: ref30
  doi: 10.1109/TEVC.2016.2587808
– ident: ref38
  doi: 10.1007/978-3-540-70928-2_7
– ident: ref37
  doi: 10.1007/978-3-319-45823-6_90
– ident: ref36
  doi: 10.1007/978-3-642-29178-4_39
– ident: ref15
  doi: 10.1007/978-3-642-01020-0_12
– ident: ref9
  doi: 10.2514/1.46478
– ident: ref58
  doi: 10.1109/ACCESS.2017.2751071
– ident: ref54
  doi: 10.1016/j.advengsoft.2011.05.014
– ident: ref5
  doi: 10.1109/TEVC.2013.2281535
– ident: ref47
  doi: 10.1145/3205651.3208224
– ident: ref8
  doi: 10.1109/MCDM.2009.4938831
– ident: ref53
  doi: 10.1162/EVCO_a_00009
– ident: ref2
  doi: 10.1109/4235.996017
– ident: ref21
  doi: 10.1109/TEVC.2017.2707980
– start-page: 367
  year: 2008
  ident: ref11
  article-title: Decision space diversity can be essential for solving multiobjective real-world problems
  publication-title: Proc MCD
– ident: ref33
  doi: 10.1145/3067695.3082527
– ident: ref24
  doi: 10.1109/TEVC.2018.2879406
– ident: ref18
  doi: 10.1109/TEVC.2015.2420112
– volume: 18
  start-page: 909
  year: 2014
  ident: ref45
  article-title: Stable matching-based selection in evolutionary multiobjective optimization
  publication-title: IEEE Trans Evol Comput
  doi: 10.1109/TEVC.2013.2293776
– ident: ref44
  doi: 10.1109/CEC.2009.4982949
– ident: ref42
  doi: 10.1007/978-3-319-15892-1_8
– ident: ref32
  doi: 10.1109/TEVC.2009.2021467
– ident: ref56
  doi: 10.1109/TEVC.2016.2587749
– ident: ref17
  doi: 10.1007/978-3-319-99253-2_20
– ident: ref4
  doi: 10.1109/TEVC.2007.892759
– ident: ref3
  doi: 10.1007/978-3-540-30217-9_84
– ident: ref13
  doi: 10.1016/j.ejor.2006.06.042
– ident: ref31
  doi: 10.1109/TEVC.2016.2592479
– ident: ref48
  doi: 10.1109/TEVC.2014.2350987
– ident: ref16
  doi: 10.1109/TEVC.2017.2754271
– ident: ref25
  doi: 10.1007/978-3-540-31880-4_4
– ident: ref40
  doi: 10.1109/TEVC.2018.2883094
– ident: ref22
  doi: 10.1109/TEVC.2016.2519378
– start-page: 688
  year: 2004
  ident: ref43
  article-title: A study of the parallelization of a coevolutionary multi-objective evolutionary algorithm
  publication-title: Proceedings of MICAI
– ident: ref59
  doi: 10.1007/s00500-017-2965-0
– ident: ref12
  doi: 10.1109/CEC.2011.5949936
– ident: ref39
  doi: 10.1145/2576768.2598276
– ident: ref26
  doi: 10.1109/TEVC.2008.925798
– ident: ref51
  doi: 10.1109/CEC.2016.7744093
– ident: ref28
  doi: 10.1023/A:1008202821328
– ident: ref49
  doi: 10.1109/TEVC.2015.2455812
– ident: ref35
  doi: 10.1145/1143997.1143999
– ident: ref23
  doi: 10.1142/S1469026817500067
– volume: 21
  start-page: 440
  year: 2017
  ident: ref6
  article-title: A survey of multiobjective evolutionary algorithms based on decomposition
  publication-title: IEEE Trans Evol Comput
– ident: ref46
  doi: 10.1109/TEVC.2014.2339823
– ident: ref29
  doi: 10.1162/EVCO_a_00109
– volume: 9
  start-page: 115
  year: 1995
  ident: ref27
  article-title: Simulated binary crossover for continuous search space
  publication-title: Complex Syst
– ident: ref10
  doi: 10.1109/CEC.2005.1554690
– ident: ref50
  doi: 10.1007/11844297_52
– start-page: 859
  year: 2005
  ident: ref7
  article-title: A multi-objective multi-modal optimization approach for mining stable spatio-temporal patterns
  publication-title: Proc IJCAI
– ident: ref55
  doi: 10.1145/1830483.1830569
– ident: ref1
  doi: 10.1007/978-1-4615-5563-6
– ident: ref52
  doi: 10.1007/978-3-642-15871-1_10
SSID ssj0014519
Score 2.5459375
Snippet Multimodal multiobjective optimization is to locate (almost) equivalent Pareto optimal solutions as many as possible. While decomposition-based evolutionary...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 720
SubjectTerms Benchmark testing
Decision making
Decomposition
Decomposition-based evolutionary algorithms
Equivalence
Evolutionary algorithms
Evolutionary computation
Genetic algorithms
Indexes
multimodal multiobjective optimization
Multiple objective analysis
Optimization
Pareto optimization
Pareto optimum
Performance enhancement
reference vector-based evolutionary algorithms
Solution space
solution space diversity
Spatial diversity
Title A Framework to Handle Multimodal Multiobjective Optimization in Decomposition-Based Evolutionary Algorithms
URI https://ieeexplore.ieee.org/document/8884131
https://www.proquest.com/docview/2429298620
Volume 24
WOSCitedRecordID wos000554887000008&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/eLvHCXMwlV07T8MwED5BxQAD5SnKSx6YEAEnTuN4LKVVp8JQULfIr0ChbVAbkPj32I5bgUBIKIsH-xTls-8Rf3cHcJZLLAVOWMC14kEsIh6IRJiolUueY5YmRGDXbIL2--lwyO5W4GKZC6O1duQzfWmH7i5fFfLN_iq7MtGa0bkm1lmllFa5WssbA1smpSLTM-MxpkN_gxlidjXoPLQtiYtdRixmaRx-s0GuqcoPTezMS7f-vxfbgk3vRqJWhfs2rOjpDtQXLRqQP7E7sPGl3uAuvLRQd0HGQmWBeq7EAnJJuJNCGYFuWIjnSg2iW6NQJj5TE42m6EZbCrrneQXXxgIq1Hn3u5fPPlBr_FjMRuXTZL4H993OoN0LfLeFQJImKwMS6zCnhIgkzIUtC6-Nq6d40hRNKSgRPAoFlamIc5knWoiICtLUJr41843Twsk-1KbFVB8AYikxsrCiucZxrowQ81BFlVQJ5xFpAF58_0z6UuS2I8Y4cyEJZpmFLLOQZR6yBpwvl7xWdTj-mrxrMVpO9PA04HgBcuZP6jyLbL8usycjfPj7qiNYj2yM7Uh_x1ArZ2_6BNbkezmaz07dJvwE17fdbQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NjxIxFH8hq4l6EAU3oqg9eDIOdNr56hERghHRAxpuk37NLrvAGBhI9r_ftlOIZjcmZi49tC-T-bXvY_p77wG8LySWAics4FrxIBKEByIRJmrlkheYZQkV2DWbSGezbLFgPxrw8ZQLo7V25DPds0N3l69Kube_yvomWjM618Q6D-IoImGdrXW6M7CFUmo6PTM-Y7bwd5ghZv356NfQ0rhYj7CIZVH4lxVybVXu6GJnYMbN_3u1Z_DUO5JoUCP_HBp604LmsUkD8me2BU_-qDjYhusBGh_pWKgq0cQVWUAuDXddKiPQDUtxVStC9N2olLXP1UTLDfqsLQndM72CT8YGKjQ6-P3LtzdosLoot8vqcr17AT_Ho_lwEvh-C4GkMasCGumwSCkVSVgIWxheG2dP8SQWsRQpFZyEIpWZiApZJFoIkgoaaxPhmvnGbeH0HM425Ua_BMQyamRhlRYaR4UyQsyTqlRJlXBOaAfw8fvn0hcjtz0xVrkLSjDLLWS5hSz3kHXgw2nJ77oSx78mty1Gp4keng50jyDn_qzucmI7dpldSfCr-1e9g0eT-bdpPv0y-_oaHhMbcTsKYBfOqu1ev4GH8lAtd9u3bkPeAn--4LQ
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+Framework+to+Handle+Multimodal+Multiobjective+Optimization+in+Decomposition-Based+Evolutionary+Algorithms&rft.jtitle=IEEE+transactions+on+evolutionary+computation&rft.au=Tanabe%2C+Ryoji&rft.au=Ishibuchi%2C+Hisao&rft.date=2020-08-01&rft.issn=1089-778X&rft.eissn=1941-0026&rft.volume=24&rft.issue=4&rft.spage=720&rft.epage=734&rft_id=info:doi/10.1109%2FTEVC.2019.2949841&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TEVC_2019_2949841
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