The Automatic Design of Multiobjective Ant Colony Optimization Algorithms

Multiobjective optimization problems are problems with several, typically conflicting, criteria for evaluating solutions. Without any a priori preference information, the Pareto optimality principle establishes a partial order among solutions, and the output of the algorithm becomes a set of nondomi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on evolutionary computation Jg. 16; H. 6; S. 861 - 875
Hauptverfasser: Lopez-Ibanez, M., Stutzle, T.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.12.2012
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
ISSN:1089-778X, 1941-0026
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Multiobjective optimization problems are problems with several, typically conflicting, criteria for evaluating solutions. Without any a priori preference information, the Pareto optimality principle establishes a partial order among solutions, and the output of the algorithm becomes a set of nondominated solutions rather than a single one. Various ant colony optimization (ACO) algorithms have been proposed in recent years for solving such problems. These multiobjective ACO (MOACO) algorithms exhibit different design choices for dealing with the particularities of the multiobjective context. This paper proposes a formulation of algorithmic components that suffices to describe most MOACO algorithms proposed so far. This formulation also shows that existing MOACO algorithms often share equivalent design choices, but they are described in different terms. Moreover, this formulation is synthesized into a flexible algorithmic framework, from which not only existing MOACO algorithms may be instantiated, but also combinations of components that were never studied in the literature. In this sense, this paper goes beyond proposing a new MOACO algorithm, but it rather introduces a family of MOACO algorithms. The flexibility of the proposed MOACO framework facilitates the application of automatic algorithm configuration techniques. The experimental results presented in this paper show that the automatically configured MOACO framework outperforms the MOACO algorithms that inspired the framework itself. This paper is also among the first to apply automatic algorithm configuration techniques to multiobjective algorithms.
AbstractList Multiobjective optimization problems are problems with several, typically conflicting, criteria for evaluating solutions. Without any a priori preference information, the Pareto optimality principle establishes a partial order among solutions, and the output of the algorithm becomes a set of nondominated solutions rather than a single one. Various ant colony optimization (ACO) algorithms have been proposed in recent years for solving such problems. These multiobjective ACO (MOACO) algorithms exhibit different design choices for dealing with the particularities of the multiobjective context. This paper proposes a formulation of algorithmic components that suffices to describe most MOACO algorithms proposed so far. This formulation also shows that existing MOACO algorithms often share equivalent design choices, but they are described in different terms. Moreover, this formulation is synthesized into a flexible algorithmic framework, from which not only existing MOACO algorithms may be instantiated, but also combinations of components that were never studied in the literature. In this sense, this paper goes beyond proposing a new MOACO algorithm, but it rather introduces a family of MOACO algorithms. The flexibility of the proposed MOACO framework facilitates the application of automatic algorithm configuration techniques. The experimental results presented in this paper show that the automatically configured MOACO framework outperforms the MOACO algorithms that inspired the framework itself. This paper is also among the first to apply automatic algorithm configuration techniques to multiobjective algorithms.
Author Lopez-Ibanez, M.
Stutzle, T.
Author_xml – sequence: 1
  givenname: M.
  surname: Lopez-Ibanez
  fullname: Lopez-Ibanez, M.
  email: manuel.lopez-ibanez@ulb.ac.be
  organization: Inst. de Rech. Interdisciplinaires et de Developpements en Intell. Artificielle, Univ. Libre de Bruxelles, Brussels, Belgium
– sequence: 2
  givenname: T.
  surname: Stutzle
  fullname: Stutzle, T.
  email: stuetzle@ulb.ac.be
  organization: Inst. de Rech. Interdisciplinaires et de Developpements en Intell. Artificielle, Univ. Libre de Bruxelles, Brussels, Belgium
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=26811921$$DView record in Pascal Francis
BookMark eNp9kcFq3DAQhkVJoEmaByi9GEqhF281sixLx2WTtoGUXDahNyFrx4kWW9pKciF9-mq7Sw45FB1Gh--bGeY_Jyc-eCTkPdAFAFVf1tcPqwWjAAsGkokW3pAzUBxqSpk4KX8qVd118udbcp7SllLgLagzcrN-wmo55zCZ7Gx1hck9-ioM1Y95zC70W7TZ_S6Iz9UqjME_V3e77Cb3p_DBV8vxMUSXn6b0jpwOZkx4eawX5P7r9Xr1vb69-3azWt7Wlos215ZuNgJR8o3qJXJppO2EQUnL6xm2faNwaKw0Qy94y2mvuBxM14BtBaieNRfk86HvLoZfM6asJ5csjqPxGOakQXTAaQOMF_TjK3Qb5ujLdhoYo0oAyK5Qn46USdaMQzTeuqR30U0mPmsmJIBiUDg4cDaGlCIOLwhQvQ9B70PQ-xD0MYTidK8c6_K_y-Vo3Phf88PBdIj4MklAC0Vo_gIpFZVJ
CODEN ITEVF5
CitedBy_id crossref_primary_10_1016_j_procs_2015_08_165
crossref_primary_10_1109_ACCESS_2018_2822824
crossref_primary_10_1016_j_asoc_2017_01_029
crossref_primary_10_3390_a13100252
crossref_primary_10_1007_s12293_025_00435_9
crossref_primary_10_1109_TCYB_2018_2832640
crossref_primary_10_1016_j_engappai_2019_103239
crossref_primary_10_1049_iet_syb_2015_0064
crossref_primary_10_1162_evco_a_00240
crossref_primary_10_1162_evco_a_00245
crossref_primary_10_31908_19098367_3823
crossref_primary_10_1109_TITS_2017_2665042
crossref_primary_10_1016_j_swevo_2021_100865
crossref_primary_10_1016_j_jocs_2024_102308
crossref_primary_10_1016_j_asoc_2013_05_009
crossref_primary_10_1016_j_eswa_2023_121431
crossref_primary_10_1016_j_ijepes_2015_09_010
crossref_primary_10_1007_s11042_022_14254_4
crossref_primary_10_1016_j_ejor_2020_07_059
crossref_primary_10_1016_j_ins_2020_06_028
crossref_primary_10_1371_journal_pone_0146709
crossref_primary_10_1007_s12145_025_01904_y
crossref_primary_10_1016_j_jfranklin_2017_08_020
crossref_primary_10_1016_j_ejor_2019_01_018
crossref_primary_10_1109_TEVC_2022_3211336
crossref_primary_10_20965_jaciii_2025_p0606
crossref_primary_10_1016_j_eswa_2019_04_027
crossref_primary_10_12677_SEA_2020_96054
crossref_primary_10_1007_s00500_015_1991_z
crossref_primary_10_1016_j_eswa_2019_04_024
crossref_primary_10_3390_info10010011
crossref_primary_10_1016_j_cor_2018_12_015
crossref_primary_10_1016_j_eswa_2021_115493
crossref_primary_10_1016_j_cor_2015_04_003
crossref_primary_10_1016_j_cor_2016_04_025
crossref_primary_10_1109_TSMC_2015_2399475
crossref_primary_10_1007_s11721_017_0131_z
crossref_primary_10_1007_s11721_017_0133_x
crossref_primary_10_1016_j_cor_2014_05_020
crossref_primary_10_1016_j_ejor_2013_10_043
crossref_primary_10_1109_TEVC_2015_2474158
crossref_primary_10_1371_journal_pone_0292266
crossref_primary_10_1109_TEVC_2021_3102863
crossref_primary_10_1016_j_eswa_2018_03_030
crossref_primary_10_1109_ACCESS_2019_2903910
crossref_primary_10_1016_j_eswa_2022_117151
crossref_primary_10_1016_j_ins_2015_11_008
crossref_primary_10_1016_j_knosys_2019_104894
crossref_primary_10_1162_evco_a_00263
crossref_primary_10_1007_s00500_018_3622_y
crossref_primary_10_1016_j_ejor_2024_06_001
crossref_primary_10_1016_j_plrev_2024_09_014
crossref_primary_10_1145_3716638
crossref_primary_10_1162_evco_a_00217
crossref_primary_10_1007_s11721_023_00227_2
crossref_primary_10_1016_j_amc_2014_01_146
crossref_primary_10_1016_j_ejor_2019_10_004
crossref_primary_10_1016_j_swevo_2014_10_006
crossref_primary_10_1007_s10845_018_1398_7
crossref_primary_10_1109_TCOMM_2018_2803068
crossref_primary_10_1155_2017_4953280
crossref_primary_10_3390_en16010213
crossref_primary_10_1109_MCI_2020_2976182
crossref_primary_10_1007_s12065_021_00613_x
crossref_primary_10_1007_s11721_013_0088_5
crossref_primary_10_1080_0952813X_2020_1789753
crossref_primary_10_1109_JSYST_2021_3100409
crossref_primary_10_1007_s10732_017_9356_7
crossref_primary_10_1007_s11831_024_10178_4
crossref_primary_10_1016_j_cor_2021_105615
crossref_primary_10_1016_j_eswa_2022_117667
crossref_primary_10_1111_itor_12902
crossref_primary_10_1016_j_swevo_2021_100977
crossref_primary_10_1016_j_ins_2018_08_058
crossref_primary_10_1109_TPWRD_2015_2445913
crossref_primary_10_1038_s41598_024_56957_8
crossref_primary_10_1049_el_2019_1933
Cites_doi 10.1007/978-3-642-15844-5_73
10.1007/978-3-642-14156-0_12
10.1109/TEVC.2003.810758
10.1007/978-3-642-15461-4_9
10.1016/j.cor.2008.11.013
10.1007/b99492
10.1007/978-3-540-76931-6_21
10.1007/978-3-642-00483-4
10.1109/CEC.2006.1688440
10.1007/s11721-009-0029-5
10.1007/978-3-540-75514-2_9
10.1109/TEVC.2007.892762
10.1007/978-3-540-28646-2_19
10.1016/j.ejor.2006.03.041
10.1109/3477.484436
10.1007/3-540-44719-9_25
10.1109/4235.585892
10.1007/s11721-008-0022-4
10.1023/B:ANOR.0000039513.99038.c6
10.1007/s10732-009-9103-9
10.1016/j.cor.2009.01.005
10.1007/BF02578918
10.1016/S0167-739X(00)00043-1
10.1007/978-3-642-02538-9_13
10.1109/ICTAI.2007.108
ContentType Journal Article
Copyright 2014 INIST-CNRS
Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 2012
Copyright_xml – notice: 2014 INIST-CNRS
– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 2012
DBID 97E
RIA
RIE
AAYXX
CITATION
IQODW
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
DOI 10.1109/TEVC.2011.2182651
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005-present
IEEE All-Society Periodicals Package (ASPP) 1998-Present
IEEE Electronic Library (IEL)
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 Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Applied Sciences
EISSN 1941-0026
EndPage 875
ExternalDocumentID 2829002761
26811921
10_1109_TEVC_2011_2182651
6151110
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-c465t-c0dd6ee84d9b8e48a8c76ae80808b2e5b39ef3c8afb64540b948fa731c5619b23
IEDL.DBID RIE
ISICitedReferencesCount 132
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000314269000008&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 Sep 28 00:02:33 EDT 2025
Sun Nov 30 05:03:30 EST 2025
Mon Jul 21 09:13:25 EDT 2025
Sat Nov 29 03:13:46 EST 2025
Tue Nov 18 21:46:38 EST 2025
Tue Aug 26 17:19:21 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 6
Keywords automatic algorithm configuration
Ant colony optimization
Artificial life
Nondominated set
traveling salesman problem
Pareto optimum
Multiobjective programming
Algorithmics
Travelling salesman problem
Partial ordering
Flexibility
Particle swarm optimization
multiobjective optimization
Experimental result
Experimental design
Preference
A priori estimation
Problem solving
Swarm intelligence
Optimality principle
Ant colony optimization (ACO)
Mathematical programming
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c465t-c0dd6ee84d9b8e48a8c76ae80808b2e5b39ef3c8afb64540b948fa731c5619b23
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
OpenAccessLink http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/138562
PQID 1220961187
PQPubID 85418
PageCount 15
ParticipantIDs crossref_primary_10_1109_TEVC_2011_2182651
proquest_journals_1220961187
pascalfrancis_primary_26811921
proquest_miscellaneous_1671403124
ieee_primary_6151110
crossref_citationtrail_10_1109_TEVC_2011_2182651
PublicationCentury 2000
PublicationDate 2012-12-01
PublicationDateYYYYMMDD 2012-12-01
PublicationDate_xml – month: 12
  year: 2012
  text: 2012-12-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 2012
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 ref35
ref13
ref34
ref12
ref15
hoos (ref21) 2005
ref31
ref33
ref11
ref32
ref10
lpez-ibez (ref18) 2011
sttzle (ref36) 1999
ref39
lpez-ibez (ref38) 2011
ref17
sttzle (ref2) 2011; 2
ref19
mariano (ref30) 1999
khudabukhsh (ref16) 2009
barn (ref6) 2003
iredi (ref7) 2001; lncs 1993
ref24
ref23
ref22
dorigo (ref1) 2004
doerner (ref26) 2003; 11
sttzle (ref37) 2002
ref29
ref8
lpez-ibez (ref14) 2010
ref9
ref4
gambardella (ref27) 1999
ref3
guntsch (ref28) 2003; lncs 2632
birattari (ref20) 2009; 197
ref5
zitzler (ref25) 2002
References_xml – ident: ref19
  doi: 10.1007/978-3-642-15844-5_73
– ident: ref13
  doi: 10.1007/978-3-642-14156-0_12
– ident: ref35
  doi: 10.1109/TEVC.2003.810758
– start-page: 63
  year: 1999
  ident: ref27
  publication-title: New Ideas in Optimization
– start-page: 137
  year: 1999
  ident: ref36
  publication-title: Meta-Heuristics Advances and Trends in Local Search Paradigms for Optimization
– ident: ref15
  doi: 10.1007/978-3-642-15461-4_9
– volume: lncs 2632
  start-page: 464
  year: 2003
  ident: ref28
  article-title: Solving multiobjective permutation problems with population based ACO
  publication-title: Proc EMO
– ident: ref23
  doi: 10.1016/j.cor.2008.11.013
– year: 2004
  ident: ref1
  publication-title: Ant Colony Optimization
  doi: 10.1007/b99492
– volume: 11
  start-page: 115
  year: 2003
  ident: ref26
  article-title: Are CompetAnts more competent for problem solving? The case of a multiple objective transportation problem
  publication-title: Central Eur J Oper Res Econ
– year: 2011
  ident: ref18
  publication-title: The irace package Iterated race for automatic algorithm configuration
– ident: ref29
  doi: 10.1007/978-3-540-76931-6_21
– volume: 197
  year: 2009
  ident: ref20
  publication-title: Tuning Metaheuristics A Machine Learning Perspective
  doi: 10.1007/978-3-642-00483-4
– volume: 2
  start-page: 896
  year: 2011
  ident: ref2
  publication-title: Wiley Encyclopedia of Operations Research and Management Science
– year: 2005
  ident: ref21
  publication-title: Stochastic Local SearchFoundations and Applications
– ident: ref34
  doi: 10.1109/CEC.2006.1688440
– ident: ref31
  doi: 10.1007/s11721-009-0029-5
– ident: ref17
  doi: 10.1007/978-3-540-75514-2_9
– ident: ref32
  doi: 10.1109/TEVC.2007.892762
– start-page: 97
  year: 2003
  ident: ref6
  article-title: A multiobjective ant colony system for vehicle routing problem with time windows
  publication-title: Proc 21st IASTED Int Conf Appl Informatics
– ident: ref8
  doi: 10.1007/978-3-540-28646-2_19
– ident: ref4
  doi: 10.1016/j.ejor.2006.03.041
– start-page: 71
  year: 2010
  ident: ref14
  article-title: The impact of design choices of multiobjective ant colony optimization algorithms on performance: An experimental study on the biobjective TSP
  publication-title: Proc GECCO
– ident: ref10
  doi: 10.1109/3477.484436
– volume: lncs 1993
  start-page: 359
  year: 2001
  ident: ref7
  article-title: Bi-criterion optimization with multicolony ant algorithms
  publication-title: Proc Evol Multi-Criterion Optimization
  doi: 10.1007/3-540-44719-9_25
– start-page: 95
  year: 2002
  ident: ref25
  publication-title: Evolutionary Methods for Design Optimisation and Control
– ident: ref12
  doi: 10.1109/4235.585892
– start-page: 894
  year: 1999
  ident: ref30
  article-title: MOAQ: An Ant-Q algorithm for multiple objective optimization problems
  publication-title: Proc GECCO
– ident: ref3
  doi: 10.1007/s11721-008-0022-4
– ident: ref5
  doi: 10.1023/B:ANOR.0000039513.99038.c6
– ident: ref24
  doi: 10.1007/s10732-009-9103-9
– ident: ref39
  doi: 10.1016/j.cor.2009.01.005
– ident: ref22
  doi: 10.1007/BF02578918
– start-page: 517
  year: 2009
  ident: ref16
  article-title: SATenstein: Automatically building local search SAT solvers from components
  publication-title: Proc 21st IJCAI
– year: 2002
  ident: ref37
  publication-title: ACOTSP A Software Package of Various Ant Colony Optimization Algorithms Applied to the Symmetric Traveling Salesman Problem
– ident: ref11
  doi: 10.1016/S0167-739X(00)00043-1
– year: 2011
  ident: ref38
  publication-title: The Automatic Design of Multiobjective Ant Colony Optimization Algorithms Supplementary Material
– ident: ref33
  doi: 10.1007/978-3-642-02538-9_13
– ident: ref9
  doi: 10.1109/ICTAI.2007.108
SSID ssj0014519
Score 2.4879727
Snippet Multiobjective optimization problems are problems with several, typically conflicting, criteria for evaluating solutions. Without any a priori preference...
SourceID proquest
pascalfrancis
crossref
ieee
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 861
SubjectTerms Algorithm design and analysis
Algorithmics. Computability. Computer arithmetics
Algorithms
Ant colony optimization
Ant colony optimization (ACO)
Applied sciences
automatic algorithm configuration
Computer science; control theory; systems
Context
Dealing
Decision theory. Utility theory
Equivalence
Exact sciences and technology
Flexibility
Formulations
Logistics
Mathematical models
multiobjective optimization
Operational research and scientific management
Operational research. Management science
Operations research
Optimization
Software
Software algorithms
Software engineering
Studies
Theoretical computing
traveling salesman problem
Traveling salesman problems
Vectors
Title The Automatic Design of Multiobjective Ant Colony Optimization Algorithms
URI https://ieeexplore.ieee.org/document/6151110
https://www.proquest.com/docview/1220961187
https://www.proquest.com/docview/1671403124
Volume 16
WOSCitedRecordID wos000314269000008&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/eLvHCXMwlV3BTtwwEB1R1EN7AAqtGgrISD1VTYmdTWwfVwuovUAPtNpbFDuTFgRJtZtF4u_rsb0RqFWl3iJ5olgee2acmXkP4D1KVLJxtxOlGndBaYROjeUmrQvpPETtrAMGsgl5caHmc_11Az6OvTCI6IvP8BM9-lx-09sV_So7Ie_LqZ_qmZQy9GqNGQOCSQnF9NpFjGoeM5g80ydXZ99nAayT4MrLgj_xQZ5UhUoi66VblTbQWfxhmb27Od_-v4nuwFYMK9k07INXsIHdLmyvKRtYPMG78PIR_uAefHGbhE1XQ-9xW9mpr-Zgfct8W25vboI1ZNNuYDNnJbsHdulMzF3s3WTT2x_94nr4ebd8Dd_Oz65mn9PIrZDaSVkMqc2apkRUk0YbhRNVKyvLGgllUhmBhck1trlVdWsI8yszeqLaWubcuoBLG5G_gc2u7_AtMEJMywTmKNCJttYURdnywuaEhGOtTiBbr3ZlI_A48V_cVv4CkumKFFSRgqqooAQ-jK_8Cqgb_xLeIw2MgnHxEzh6otJxXJSKEwpcAgdrHVfx4C4rLgSR4HAlEzgeh92RozxK3WG_cjKlRzl0kdH-3z_9Dl64CYpQ9XIAm8NihYfw3N4P18vFkd-3vwEPYen-
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fb9QwDLamgQR7YLCBKIwRJJ4QZU36K3k8HZs2MQ4eDnRvVZO6Y2hrp7seEv89cZKrmEBIvFWKq0ZxYju1_X0Ar7FEWTb2diJlYy8ojVCxNlzHdV5aD1Fb64CebKKczeRioT5vwduxFwYRXfEZvqNHl8tverOmX2VH5H059VPdybNMcN-tNeYMCCjFl9MrGzPKRchh8kQdzY-_Tj1cJwGWFzm_5YUcrQoVRdYruy6tJ7T4wzY7h3Oy-39TfQgPQmDJJn4nPIIt7PZgd0PawMIZ3oOd3xAI9-HMbhM2WQ-9Q25l7109B-tb5hpze_3d20M26QY2tXay-8k-WSNzHbo32eTqol9eDt-uV4_hy8nxfHoaB3aF2GRFPsQmaZoCUWaN0hIzWUtTFjUSzqTUAnOdKmxTI-tWE-pXolUm27pMubEhl9IifQLbXd_hU2CEmZYITFGgFW2NzvOi5blJCQvHGBVBslntygTocWLAuKrcFSRRFSmoIgVVQUERvBlfufG4G_8S3icNjIJh8SM4vKXScVwUkhMOXAQHGx1X4eiuKi4E0eBwWUbwahy2h44yKXWH_drKFA7n0MZGz_7-6Zdw73T-8bw6P5t9eA737WSFr4E5gO1hucYXcNf8GC5Xy0O3h38BX4ntRQ
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=The+Automatic+Design+of+Multiobjective+Ant+Colony+Optimization+Algorithms&rft.jtitle=IEEE+transactions+on+evolutionary+computation&rft.au=Lopez-Ibanez%2C+Manuel&rft.au=Stutzle%2C+Thomas&rft.date=2012-12-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1089-778X&rft.eissn=1941-0026&rft.volume=16&rft.issue=6&rft.spage=861&rft_id=info:doi/10.1109%2FTEVC.2011.2182651&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2829002761
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