On the Influence of the Number of Objectives on the Hardness of a Multiobjective Optimization Problem

In this paper, we study the influence of the number of objectives of a continuous multiobjective optimization problem on its hardness for evolution strategies which is of particular interest for many-objective optimization problems. To be more precise, we measure the hardness in terms of the evoluti...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on evolutionary computation Ročník 15; číslo 4; s. 444 - 455
Hlavní autoři: Schutze, O., Lara, A., Coello, C. A. C.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.08.2011
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:1089-778X, 1941-0026
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!
Abstract In this paper, we study the influence of the number of objectives of a continuous multiobjective optimization problem on its hardness for evolution strategies which is of particular interest for many-objective optimization problems. To be more precise, we measure the hardness in terms of the evolution (or convergence) of the population toward the set of interest, the Pareto set. Previous related studies consider mainly the number of nondominated individuals within a population which greatly improved the understanding of the problem and has led to possible remedies. However, in certain cases this ansatz is not sophisticated enough to understand all phenomena, and can even be misleading. In this paper, we suggest alternatively to consider the probability to improve the situation of the population which can, to a certain extent, be measured by the sizes of the descent cones. As an example, we make some qualitative considerations on a general class of uni-modal test problems and conjecture that these problems get harder by adding an objective, but that this difference is practically not significant, and we support this by some empirical studies. Further, we address the scalability in the number of objectives observed in the literature. That is, we try to extract the challenges for the treatment of many-objective problems for evolution strategies based on our observations and use them to explain recent advances in this field.
AbstractList In this paper, we study the influence of the number of objectives of a continuous multiobjective optimization problem on its hardness for evolution strategies which is of particular interest for many-objective optimization problems. To be more precise, we measure the hardness in terms of the evolution (or convergence) of the population toward the set of interest, the Pareto set. Previous related studies consider mainly the number of nondominated individuals within a population which greatly improved the understanding of the problem and has led to possible remedies. However, in certain cases this ansatz is not sophisticated enough to understand all phenomena, and can even be misleading. In this paper, we suggest alternatively to consider the probability to improve the situation of the population which can, to a certain extent, be measured by the sizes of the descent cones. As an example, we make some qualitative considerations on a general class of uni-modal test problems and conjecture that these problems get harder by adding an objective, but that this difference is practically not significant, and we support this by some empirical studies. Further, we address the scalability in the number of objectives observed in the literature. That is, we try to extract the challenges for the treatment of many-objective problems for evolution strategies based on our observations and use them to explain recent advances in this field.
Author Schutze, O.
Lara, A.
Coello, C. A. C.
Author_xml – sequence: 1
  givenname: O.
  surname: Schutze
  fullname: Schutze, O.
  email: schuetze@cs.cinvestav.mx
  organization: Dept. of Comput. Sci., CINVESTAV IPN, Mexico City, Mexico
– sequence: 2
  givenname: A.
  surname: Lara
  fullname: Lara, A.
  email: alara@computacion.cs.cinvestav.mx
  organization: Dept. of Comput. Sci., CINVESTAV IPN, Mexico City, Mexico
– sequence: 3
  givenname: C. A. C.
  surname: Coello
  fullname: Coello, C. A. C.
  email: ccoello@cs.cinvestav.mx
  organization: Dept. of Comput. Sci., CINVESTAV IPN, Mexico City, Mexico
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=24404812$$DView record in Pascal Francis
BookMark eNp9kU9v1DAQxS1UJNrCB0BcIiTEKWXGdv74iFaFViosh4K4WbY7EV4l9mInSPDpcbpLDz1wsmfm995YfmfsJMRAjL1EuEAE9e728tvmgkMpObRScHzCTlFJrAF4e1Lu0Ku66_rvz9hZzjsAlA2qU0bbUM0_qLoOw7hQcFTF4b7xeZkspbXa2h252f-iXMUDfGXSXaCc16mpPi3j7OM_qNruZz_5P6b0QvUlRTvS9Jw9HcyY6cXxPGdfP1zebq7qm-3H6837m9pJDnMtwIK4k8q1CrC1AqTqXNsQt42yPcfe8DK2g1JorXNIaAWSQkmiaaXrxTl7e_Ddp_hzoTzryWdH42gCxSVrBZ3qijkv5OtH5C4uKZTH6b5TqgXRNwV6c4RMdmYckgnOZ71PfjLpt-ZSguxxNcMD51LMOdHwgCDoNR69xqPXePQxnqLpHmmcn-8_bU7Gj_9VvjooPRE9bGpawK5R4i9plZ2R
CODEN ITEVF5
CitedBy_id crossref_primary_10_1109_TEVC_2013_2262178
crossref_primary_10_1016_j_ins_2013_06_037
crossref_primary_10_1016_j_ins_2015_01_018
crossref_primary_10_1016_j_ins_2013_11_023
crossref_primary_10_1109_TCYB_2013_2247594
crossref_primary_10_1109_ACCESS_2020_3005970
crossref_primary_10_1016_j_jaerosci_2025_106556
crossref_primary_10_1109_TCYB_2019_2894664
crossref_primary_10_1109_TEVC_2012_2227145
crossref_primary_10_1016_j_asoc_2023_110672
crossref_primary_10_1007_s00500_017_2840_z
crossref_primary_10_1016_j_swevo_2021_100943
crossref_primary_10_1080_0305215X_2011_637556
crossref_primary_10_1109_TEVC_2017_2695579
crossref_primary_10_1109_TEVC_2016_2519758
crossref_primary_10_1007_s12293_015_0170_1
crossref_primary_10_1016_j_asoc_2024_111967
crossref_primary_10_1109_TEVC_2016_2639360
crossref_primary_10_1109_TEVC_2014_2378512
crossref_primary_10_1007_s10489_020_02025_3
crossref_primary_10_1016_j_asoc_2016_08_042
crossref_primary_10_1007_s00500_016_2422_5
crossref_primary_10_1007_s10479_015_1863_z
crossref_primary_10_1016_j_procs_2014_09_037
crossref_primary_10_1007_s11227_020_03423_7
crossref_primary_10_1109_ACCESS_2018_2877402
crossref_primary_10_1145_3638461_3638462
crossref_primary_10_1016_j_ins_2014_08_071
crossref_primary_10_1109_TETCI_2017_2669104
crossref_primary_10_1016_j_neucom_2013_05_049
crossref_primary_10_1109_ACCESS_2022_3204123
crossref_primary_10_1016_j_swevo_2017_08_001
crossref_primary_10_1007_s10586_016_0643_0
crossref_primary_10_1007_s10664_015_9399_z
crossref_primary_10_1515_auto_2018_0054
crossref_primary_10_1109_TEVC_2017_2655451
crossref_primary_10_1007_s40747_019_0113_4
crossref_primary_10_1007_s10898_019_00737_6
crossref_primary_10_1109_TCYB_2016_2600577
crossref_primary_10_1016_j_swevo_2013_11_001
crossref_primary_10_1162_evco_a_00263
crossref_primary_10_1109_TEVC_2016_2519378
crossref_primary_10_1109_TAP_2017_2738065
crossref_primary_10_1007_s10489_024_05270_y
crossref_primary_10_1162_evco_a_00217
crossref_primary_10_1016_j_ast_2018_08_019
crossref_primary_10_1007_s00521_022_07611_9
crossref_primary_10_1016_j_asoc_2018_12_011
crossref_primary_10_1007_s12293_012_0077_z
crossref_primary_10_1109_ACCESS_2020_3031002
crossref_primary_10_1109_TCYB_2013_2282503
crossref_primary_10_1016_j_ins_2019_02_054
crossref_primary_10_1109_TCYB_2014_2334632
crossref_primary_10_1162_EVCO_a_00106
crossref_primary_10_1109_TCYB_2019_2925143
crossref_primary_10_1109_TRO_2025_3588763
crossref_primary_10_1016_j_cja_2017_05_003
crossref_primary_10_1016_j_swevo_2019_04_008
crossref_primary_10_1109_TEVC_2012_2204264
crossref_primary_10_1080_0305215X_2024_2420726
crossref_primary_10_1016_j_cja_2016_09_005
crossref_primary_10_1109_TEVC_2016_2623770
crossref_primary_10_3390_math7100894
crossref_primary_10_1002_widm_1267
crossref_primary_10_1016_j_ins_2014_02_002
crossref_primary_10_1109_ACCESS_2024_3404407
crossref_primary_10_1287_ijoc_2022_1260
crossref_primary_10_1007_s00500_023_08886_3
crossref_primary_10_1007_s10489_022_04115_w
crossref_primary_10_3390_mca23020030
crossref_primary_10_1109_TEVC_2014_2315442
crossref_primary_10_1016_j_cie_2014_05_013
crossref_primary_10_1016_j_jpdc_2018_11_008
crossref_primary_10_1016_j_swevo_2025_102037
Cites_doi 10.1162/evco.2010.18.1.18103
10.1525/9780520411586-036
10.1145/1276958.1277130
10.1145/1569901.1569979
10.1007/BF00582738
10.1109/TEVC.2008.2009064
10.1016/S0377-2217(98)00262-8
10.1162/106365602760234108
10.1109/TEVC.2009.2024143
10.1162/evco.2007.15.4.475
10.1007/978-3-540-70928-2_57
10.1109/CEC.2008.4631121
10.1109/TSMCA.2004.824873
10.1007/978-3-540-70928-2_5
10.1109/CEC.2003.1299927
10.1162/106365600568167
10.1007/978-3-540-70928-2_56
10.1162/106365605774666895
10.1007/s10898-007-9265-7
10.1109/4235.996017
10.1145/1068009.1068138
10.1007/978-3-0348-8280-4
10.1109/CEC.2003.1299427
10.1145/1389095.1389233
10.1109/NAFIPS.2004.1336266
10.1162/evco.1995.3.1.1
10.1109/CEC.2005.1554688
10.1007/978-3-540-70928-2_55
10.1007/s001860000043
10.1145/1569901.1569978
ContentType Journal Article
Copyright 2015 INIST-CNRS
Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Aug 2011
Copyright_xml – notice: 2015 INIST-CNRS
– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Aug 2011
DBID 97E
RIA
RIE
AAYXX
CITATION
IQODW
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
DOI 10.1109/TEVC.2010.2064321
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE/IET Electronic Library (IEL) (UW System Shared)
CrossRef
Pascal-Francis
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
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
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
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Technology Research Database
Technology Research Database

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL) (UW System Shared)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Applied Sciences
EISSN 1941-0026
EndPage 455
ExternalDocumentID 2411229401
24404812
10_1109_TEVC_2010_2064321
5601759
Genre orig-research
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
IQODW
RIG
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
ID FETCH-LOGICAL-c420t-30b03d49c69016b30497c65e2b59b8218a23d4bf991bbcc1e1b31e914e3564c83
IEDL.DBID RIE
ISICitedReferencesCount 123
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000293740700002&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 Thu Oct 02 14:57:35 EDT 2025
Sun Nov 09 07:30:48 EST 2025
Mon Jul 21 09:15:09 EDT 2025
Sat Nov 29 08:09:19 EST 2025
Tue Nov 18 21:43:01 EST 2025
Tue Aug 26 17:17:22 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords Cone
Modal analysis
Probabilistic approach
Scalability
Pareto optimum
Evolutionary algorithm
Empirical method
Multiobjective programming
many-objective optimization
Vibration test
Hardness
Convex programming
Optimization
Dynamic test
multiobjective optimization
evolutionary computation
Non differentiable programming
Descent method
Problem solving
Algorithm design
Mathematical programming
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c420t-30b03d49c69016b30497c65e2b59b8218a23d4bf991bbcc1e1b31e914e3564c83
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
PQID 879960385
PQPubID 85418
PageCount 12
ParticipantIDs crossref_primary_10_1109_TEVC_2010_2064321
proquest_miscellaneous_907976902
pascalfrancis_primary_24404812
crossref_citationtrail_10_1109_TEVC_2010_2064321
ieee_primary_5601759
proquest_journals_879960385
PublicationCentury 2000
PublicationDate 2011-08-01
PublicationDateYYYYMMDD 2011-08-01
PublicationDate_xml – month: 08
  year: 2011
  text: 2011-08-01
  day: 01
PublicationDecade 2010
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
– name: New York
PublicationTitle IEEE transactions on evolutionary computation
PublicationTitleAbbrev TEVC
PublicationYear 2011
Publisher IEEE
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: Institute of Electrical and Electronics Engineers
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref14
ref53
deb (ref11) 2001
ref54
bosman (ref4) 2005; 1
mostaghim (ref39) 2008
ref17
ref19
rudolph (ref43) 2000
fleming (ref18) 2005; lncs 3410
kuhn (ref36) 1951
deb (ref15) 2006
zitzler (ref56) 2002
ref51
ref46
ref48
ref47
ref42
ref44
van veldhuizen (ref52) 1999
pareto (ref40) 1971
ref49
aguirre (ref1) 2009
brown (ref7) 2005; 6
corne (ref9) 2007
knowles (ref31) 2001
ref3
ref5
kppen (ref33) 2005; lncs 3410
singh (ref50) 2008
corne (ref10) 2000
ref35
ref37
ref30
zitzler (ref55) 1999
ref32
ref2
ref38
schaffer (ref45) 1985
deb (ref16) 2005
karush (ref28) 1939
brockhoff (ref6) 2006
kppen (ref34) 2007
praditwong (ref41) 2007
deb (ref12) 1995; 9
ref24
horn (ref23) 1997
ref26
deb (ref13) 2005; 13
ref25
ref20
coello (ref8) 2007
ref22
ref21
ref29
lpez (ref27) 2009; lncs 5467
References_xml – year: 2007
  ident: ref8
  publication-title: Evolutionary Algorithms for Solving Multi-Objective Problems
– ident: ref49
  doi: 10.1162/evco.2010.18.1.18103
– year: 2001
  ident: ref11
  publication-title: Multi-Objective Optimization Using Evolutionary Algorithms
– start-page: 93
  year: 1985
  ident: ref45
  article-title: Multiple objective optimization with vector evaluated genetic algorithms
  publication-title: Proc 1st Int Conf Genet Algorithms
– start-page: 401
  year: 2008
  ident: ref50
  article-title: A study on the performance of substitute distance based approaches for evolutionary many objective optimization
  publication-title: Proc 7th Int Conf SEAL
– year: 2005
  ident: ref16
  publication-title: Evolutionary Multiobjective Optimization Theoretical Advances and Applications
– volume: 6
  start-page: 3
  year: 2005
  ident: ref7
  article-title: Directed multiobjective optimization
  publication-title: Int J Comput Syst Signals
– start-page: 481
  year: 1951
  ident: ref36
  article-title: Nonlinear programming
  publication-title: Proc 2nd Berkeley Symp Math Stat Probab
  doi: 10.1525/9780520411586-036
– start-page: 533
  year: 2006
  ident: ref6
  article-title: Are all objectives necessary? on dimensionality reduction in evolutionary multiobjective optimization
  publication-title: Proc 9th Int Conf PPSN
– ident: ref48
  doi: 10.1145/1276958.1277130
– ident: ref3
  doi: 10.1145/1569901.1569979
– year: 1999
  ident: ref52
  publication-title: Multiobjective evolutionary algorithms Classifications analyses and new innovations
– start-page: 407
  year: 2009
  ident: ref1
  article-title: Many-objective optimization by space partitioning and adaptive epsilon-ranking on MNK-landscapes
  publication-title: Proc 4th Int Conf EMO
– ident: ref54
  doi: 10.1007/BF00582738
– start-page: 269
  year: 2001
  ident: ref31
  article-title: Reducing local optima in single-objective problems by multi-objectivization
  publication-title: Proc 1st Int Conf EMO
– volume: lncs 3410
  start-page: 14
  year: 2005
  ident: ref18
  article-title: Many-objective optimization: An engineering design perspective
  publication-title: Proc 3rd Int Conf EMO
– ident: ref5
  doi: 10.1109/TEVC.2008.2009064
– year: 1939
  ident: ref28
  publication-title: Minima of functions of several variables with inequalities as side conditions
– ident: ref21
  doi: 10.1016/S0377-2217(98)00262-8
– start-page: 1
  year: 1997
  ident: ref23
  publication-title: Handbook of Evolutionary Computation
– ident: ref38
  doi: 10.1162/106365602760234108
– ident: ref37
  doi: 10.1109/TEVC.2009.2024143
– ident: ref51
  doi: 10.1162/evco.2007.15.4.475
– start-page: 3959
  year: 2007
  ident: ref41
  article-title: How well do multiobjective evolutionary algorithms scale to large problems?
  publication-title: Proc IEEE CEC
– ident: ref29
  doi: 10.1007/978-3-540-70928-2_57
– ident: ref26
  doi: 10.1109/CEC.2008.4631121
– ident: ref17
  doi: 10.1109/TSMCA.2004.824873
– ident: ref44
  doi: 10.1007/978-3-540-70928-2_5
– ident: ref42
  doi: 10.1109/CEC.2003.1299927
– ident: ref30
  doi: 10.1162/106365600568167
– start-page: 753
  year: 2008
  ident: ref39
  article-title: Distance based ranking in many-objective particle swarm optimization
  publication-title: Proc 10th Int Conf PPSN
– ident: ref53
  doi: 10.1007/978-3-540-70928-2_56
– volume: 13
  start-page: 501
  year: 2005
  ident: ref13
  article-title: Evaluating the <formula formulatype="inline"><tex Notation="TeX">$\epsilon$</tex></formula>-dominated based multiobjective evolutionary algorithm for a quick computation of Pareto-optimal solutions
  publication-title: Evol Comput
  doi: 10.1162/106365605774666895
– ident: ref47
  doi: 10.1007/s10898-007-9265-7
– year: 1971
  ident: ref40
  publication-title: Manual of Political Economy
– start-page: 3353
  year: 2006
  ident: ref15
  article-title: Searching for Pareto-optimal solutions through dimensionality reduction for certain large-dimensional multiobjective optimization problems
  publication-title: Proc IEEE CEC
– start-page: 773
  year: 2007
  ident: ref9
  article-title: Techniques for highly multiobjective optimization: Some nondominated points are better than others
  publication-title: Proc 9th Annu Conf GECCO
– start-page: 869
  year: 2000
  ident: ref10
  article-title: The Pareto-envelope based selection algorithm for multiobjective optimization
  publication-title: Proc 6th Int Conf PPSN
– ident: ref14
  doi: 10.1109/4235.996017
– volume: 1
  start-page: 755
  year: 2005
  ident: ref4
  article-title: Exploiting gradient information in numerical multiobjective evolutionary optimization
  publication-title: Proc GECCO
  doi: 10.1145/1068009.1068138
– ident: ref22
  doi: 10.1007/978-3-0348-8280-4
– volume: lncs 5467
  start-page: 423
  year: 2009
  ident: ref27
  article-title: Online objective reduction to deal with many-objective problems
  publication-title: Proc 5th Int Conf EMO
– ident: ref24
  doi: 10.1109/CEC.2003.1299427
– ident: ref46
  doi: 10.1145/1389095.1389233
– ident: ref32
  doi: 10.1109/NAFIPS.2004.1336266
– ident: ref20
  doi: 10.1162/evco.1995.3.1.1
– ident: ref25
  doi: 10.1109/CEC.2005.1554688
– year: 1999
  ident: ref55
  publication-title: Evolutionary algorithms for multiobjective optimization Methods and applications
– start-page: 323
  year: 2007
  ident: ref34
  article-title: Many-objective particle swarm optimization by gradual leader selection
  publication-title: Proceedings of the 7th ICANN
– ident: ref35
  doi: 10.1007/978-3-540-70928-2_55
– volume: 9
  start-page: 115
  year: 1995
  ident: ref12
  article-title: Simulated binary crossover for continuous search space
  publication-title: Complex Syst
– start-page: 95
  year: 2002
  ident: ref56
  article-title: SPEA2: Improving the strength Pareto evolutionary algorithm
  publication-title: Proc Evol Methods Des Optimization Control Applicat Ind Problems (EUROGEN)
– ident: ref19
  doi: 10.1007/s001860000043
– start-page: 1010
  year: 2000
  ident: ref43
  article-title: On a multiobjective evolutionary algorithm and its convergence to the Pareto set
  publication-title: Proc CEC
– volume: lncs 3410
  start-page: 399
  year: 2005
  ident: ref33
  article-title: Fuzzy Pareto-dominance and its application in evolutionary multiobjective optimization
  publication-title: Proc 3rd Int Conf EMO
– ident: ref2
  doi: 10.1145/1569901.1569978
SSID ssj0014519
Score 2.387339
Snippet In this paper, we study the influence of the number of objectives of a continuous multiobjective optimization problem on its hardness for evolution strategies...
SourceID proquest
pascalfrancis
crossref
ieee
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 444
SubjectTerms Algorithm design
Algorithmics. Computability. Computer arithmetics
Applied sciences
Approximation methods
Computational modeling
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Convergence
Decision theory. Utility theory
Descent
Evolution
Evolutionary computation
Exact sciences and technology
Hardness
many-objective optimization
Measurement
multiobjective optimization
Operational research and scientific management
Operational research. Management science
Optimization
Pareto optimality
Remedies
Scalability
Software
Strategy
Studies
Theoretical computing
Title On the Influence of the Number of Objectives on the Hardness of a Multiobjective Optimization Problem
URI https://ieeexplore.ieee.org/document/5601759
https://www.proquest.com/docview/879960385
https://www.proquest.com/docview/907976902
Volume 15
WOSCitedRecordID wos000293740700002&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/IET Electronic Library (IEL) (UW System Shared)
  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/eLvHCXMwlV1Lb9QwEB61FQc40BeItFD5wAkRaufl-FhVrdrLbg8F7S2yvWMJBEnV7PL78dhORAVC4pZkJkqUydifPY8P4L1GVBptk3u0UeaVEMq71FrmaFWJnDuhLA9kE3KxaFcrdbcDH-daGEQMyWf4iQ5DLH892C1tlZ3T6kHWahd2pWxirdYcMaA2KTGZXnnE2K5SBFNwdX5_9eUyJnEVNAEX4skcFEhVKCVSj_6ruEhn8cfIHKab6_3_e9EDeJlgJbuI_8Eh7GB_BPsTZQNLHnwEL37rP3gMuOyZB4DsdmIqYYMLFxaBJ4TOluZbHBJHNkRlivXT-EhSzUIB7zApsaUfgX6k0k52F8lqXsHn66v7y5s88S7ktir4Ji-54eW6UpbIqhpDgThpmxoLUyvTekygCy82zkNLY6wVKEwpUIkKy7qpbFu-hr1-6PENMGxM5bRBpbSrnNN-dWWdFAJrpdceq2XAJ0t0NjUlJ26M711YnHDVkfE6Ml6XjJfBh_mWh9iR41_Kx2SdWTEZJoOzJ-ae5QW1S_SYJ4PTyf5dcuqxayW1sinbOgM2S703UohF9zhsx05x6fGd4sXJ3x98Cs-nTWku3sLe5nGL7-CZ_bn5Oj6ehT_6FwQw83Y
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Nb9QwEB2VggQ9UGhBpIXiAydEqJ1vH6uqVSvKbg8L2ltke8dSESSo2eX347GdqBUIiVsST5TIzx_PHs88gHcKUSo0VerYRp4WQkjXpVZ1ikbmyLkV0nAvNlHPZs1yKa-34MMUC4OI_vAZfqRL78tf9WZDW2XHtHqoS_kAHpZFkfEQrTX5DChRSjhOLx1nbJbRhym4PF6cfT0Nx7gymoIzcW8W8rIqdChSDa5ebBC0-GNs9hPO-e7__eozeBqJJTsJLeE5bGG3B7ujaAOLfXgPdu5kINwHnHfMUUB2OWqVsN76BzOvFEJ3c_0tDIoD64MxeftphKRSxXwIbz8asbkbg37E4E52HeRqXsCX87PF6UUalRdS4-p1neZc83xVSENyVZUmV1xtqhIzXUrdOFagMlesrSOXWhsjUOhcoBQF5mVVmCZ_Cdtd3-ErYFjpwiqNUipbWKvc-srYWggspVo5tpYAH5FoTUxLTuoY31u_POGyJfBaAq-N4CXwfnrlZ8jJ8S_jfUJnMozAJHB0D-6pPKOEiY71JHA44t_Gbj20TU3JbPKmTIBNpa4_kpNFddhvhlby2jE8ybODv3_4LTy-WHy-aq8uZ58O4cm4Rc3Fa9he327wDTwyv9Y3w-2Rb92_Ac7w9r0
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=On+the+Influence+of+the+Number+of+Objectives+on+the+Hardness+of+a+Multiobjective+Optimization+Problem&rft.jtitle=IEEE+transactions+on+evolutionary+computation&rft.au=Schutze%2C+Oliver&rft.au=Lara%2C+Adriana&rft.au=Coello%2C+Carlos+A.+Coello&rft.date=2011-08-01&rft.issn=1089-778X&rft.eissn=1941-0026&rft.volume=15&rft.issue=4&rft.spage=444&rft.epage=455&rft_id=info:doi/10.1109%2FTEVC.2010.2064321&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TEVC_2010_2064321
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