Algorithm selection for black-box continuous optimization problems: A survey on methods and challenges
Selecting the most appropriate algorithm to use when attempting to solve a black-box continuous optimization problem is a challenging task. Such problems typically lack algebraic expressions, it is not possible to calculate derivative information, and the problem may exhibit uncertainty or noise. In...
Uloženo v:
| Vydáno v: | Information sciences Ročník 317; s. 224 - 245 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Inc
01.10.2015
|
| Témata: | |
| ISSN: | 0020-0255, 1872-6291 |
| 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 | Selecting the most appropriate algorithm to use when attempting to solve a black-box continuous optimization problem is a challenging task. Such problems typically lack algebraic expressions, it is not possible to calculate derivative information, and the problem may exhibit uncertainty or noise. In many cases, the input and output variables are analyzed without considering the internal details of the problem. Algorithm selection requires expert knowledge of search algorithm efficacy and skills in algorithm engineering and statistics. Even with the necessary knowledge and skills, success is not guaranteed.
In this paper, we present a survey of methods for algorithm selection in the black-box continuous optimization domain. We start the review by presenting Rice’s (1976) selection framework. We describe each of the four component spaces – problem, algorithm, performance and characteristic – in terms of requirements for black-box continuous optimization problems. This is followed by an examination of exploratory landscape analysis methods that can be used to effectively extract the problem characteristics. Subsequently, we propose a classification of the landscape analysis methods based on their order, neighborhood structure and computational complexity. We then discuss applications of the algorithm selection framework and the relationship between it and algorithm portfolios, hybrid meta-heuristics, and hyper-heuristics. The paper concludes with the identification of key challenges and proposes future research directions. |
|---|---|
| AbstractList | Selecting the most appropriate algorithm to use when attempting to solve a black-box continuous optimization problem is a challenging task. Such problems typically lack algebraic expressions, it is not possible to calculate derivative information, and the problem may exhibit uncertainty or noise. In many cases, the input and output variables are analyzed without considering the internal details of the problem. Algorithm selection requires expert knowledge of search algorithm efficacy and skills in algorithm engineering and statistics. Even with the necessary knowledge and skills, success is not guaranteed. In this paper, we present a survey of methods for algorithm selection in the black-box continuous optimization domain. We start the review by presenting Rice's (1976) selection framework. We describe each of the four component spaces - problem, algorithm, performance and characteristic - in terms of requirements for black-box continuous optimization problems. This is followed by an examination of exploratory landscape analysis methods that can be used to effectively extract the problem characteristics. Subsequently, we propose a classification of the landscape analysis methods based on their order, neighborhood structure and computational complexity. We then discuss applications of the algorithm selection framework and the relationship between it and algorithm portfolios, hybrid meta-heuristics, and hyper-heuristics. The paper concludes with the identification of key challenges and proposes future research directions. Selecting the most appropriate algorithm to use when attempting to solve a black-box continuous optimization problem is a challenging task. Such problems typically lack algebraic expressions, it is not possible to calculate derivative information, and the problem may exhibit uncertainty or noise. In many cases, the input and output variables are analyzed without considering the internal details of the problem. Algorithm selection requires expert knowledge of search algorithm efficacy and skills in algorithm engineering and statistics. Even with the necessary knowledge and skills, success is not guaranteed. In this paper, we present a survey of methods for algorithm selection in the black-box continuous optimization domain. We start the review by presenting Rice’s (1976) selection framework. We describe each of the four component spaces – problem, algorithm, performance and characteristic – in terms of requirements for black-box continuous optimization problems. This is followed by an examination of exploratory landscape analysis methods that can be used to effectively extract the problem characteristics. Subsequently, we propose a classification of the landscape analysis methods based on their order, neighborhood structure and computational complexity. We then discuss applications of the algorithm selection framework and the relationship between it and algorithm portfolios, hybrid meta-heuristics, and hyper-heuristics. The paper concludes with the identification of key challenges and proposes future research directions. |
| Author | Sun, Yuan Muñoz, Mario A. Kirley, Michael Halgamuge, Saman K. |
| Author_xml | – sequence: 1 givenname: Mario A. surname: Muñoz fullname: Muñoz, Mario A. email: mario.munoz@monash.edu organization: School of Mathematical Sciences, Monash University, Clayton, Victoria 3800, Australia – sequence: 2 givenname: Yuan surname: Sun fullname: Sun, Yuan organization: Department of Mechanical Engineering, The University of Melbourne, Parkville, Victoria 3010, Australia – sequence: 3 givenname: Michael surname: Kirley fullname: Kirley, Michael organization: Department of Computer and Information Systems, The University of Melbourne, Parkville, Victoria 3010, Australia – sequence: 4 givenname: Saman K. surname: Halgamuge fullname: Halgamuge, Saman K. organization: Department of Mechanical Engineering, The University of Melbourne, Parkville, Victoria 3010, Australia |
| BookMark | eNp9kMFuEzEQhi1UJNLCA3DzkcuGsTfrjeEUVRSQKnGBs-UdzzYOXjvYTkV5etyGE4dKI400-r_RzHfJLmKKxNhbAWsBQr0_rH0sawliWEMrAS_YSmxH2SmpxQVbAUjoQA7DK3ZZygEANqNSKzbvwl3Kvu4XXigQVp8in1PmU7D4s5vSb44pVh9P6VR4Ola_-D_2KXXMaQq0lA98x8sp39MDb9OF6j65wm10HPc2BIp3VF6zl7MNhd7861fsx82n79dfuttvn79e72473PS6dr2zWlstxaTkME-zU1vbaz05nK0ToBwCOk1aocCNG2YJJJ2GcQs4bBWq_oq9O-9tx_06Ualm8QUpBBupPWDEOELf92rTt6g4RzGnUjLN5pj9YvODEWAenZqDaU7No1MDrQQ0ZvyPQV-fbNRsfXiW_HgmqX1_7ymbgp4ikvO5WTcu-Wfov4vLldk |
| CitedBy_id | crossref_primary_10_1007_s42488_022_00075_5 crossref_primary_10_1109_TEVC_2022_3232844 crossref_primary_10_1016_j_net_2025_103721 crossref_primary_10_1016_j_ins_2021_08_028 crossref_primary_10_1007_s12293_022_00367_8 crossref_primary_10_1016_j_swevo_2018_07_001 crossref_primary_10_1016_j_eswa_2019_113033 crossref_primary_10_1186_s40537_023_00687_7 crossref_primary_10_1007_s00500_020_05139_5 crossref_primary_10_1007_s13369_017_2864_9 crossref_primary_10_1016_j_eswa_2021_114694 crossref_primary_10_1109_TEC_2022_3182817 crossref_primary_10_1145_3746235 crossref_primary_10_1162_evco_a_00357 crossref_primary_10_1109_TEVC_2021_3108185 crossref_primary_10_1016_j_cor_2021_105489 crossref_primary_10_1088_2058_9565_ac91f0 crossref_primary_10_1007_s13369_020_04348_2 crossref_primary_10_1007_s00521_022_07788_z crossref_primary_10_1016_j_ins_2018_10_013 crossref_primary_10_1007_s10951_024_00819_8 crossref_primary_10_1016_j_cor_2023_106290 crossref_primary_10_1016_j_swevo_2021_100981 crossref_primary_10_1007_s11047_021_09847_1 crossref_primary_10_1016_j_asoc_2017_07_016 crossref_primary_10_1007_s00500_018_3302_y crossref_primary_10_1109_ACCESS_2020_3036438 crossref_primary_10_1016_j_physrep_2016_08_001 crossref_primary_10_1016_j_ecolmodel_2020_109139 crossref_primary_10_1007_s11721_016_0129_y crossref_primary_10_1016_j_ins_2017_05_029 crossref_primary_10_1109_ACCESS_2020_2964726 crossref_primary_10_1016_j_jhydrol_2022_128093 crossref_primary_10_1016_j_neucom_2023_126549 crossref_primary_10_1109_ACCESS_2023_3274113 crossref_primary_10_1016_j_paerosci_2018_07_007 crossref_primary_10_1016_j_asoc_2023_110121 crossref_primary_10_1016_j_swevo_2023_101448 crossref_primary_10_1108_ECAM_06_2018_0246 crossref_primary_10_1016_j_ins_2024_120650 crossref_primary_10_1021_acs_iecr_5c02105 crossref_primary_10_1016_j_knosys_2023_110774 crossref_primary_10_1016_j_ejor_2017_01_016 crossref_primary_10_1145_3646554 crossref_primary_10_1007_s00170_021_07248_3 crossref_primary_10_1007_s10462_020_09882_x crossref_primary_10_1007_s10479_022_04860_8 crossref_primary_10_1016_j_ins_2022_05_106 crossref_primary_10_1007_s11063_017_9729_9 crossref_primary_10_1007_s13748_023_00311_y crossref_primary_10_1016_j_rineng_2024_101757 crossref_primary_10_1109_TEVC_2016_2599164 crossref_primary_10_1016_j_ins_2022_08_001 crossref_primary_10_1016_j_jmr_2020_106858 crossref_primary_10_1016_j_ins_2017_08_028 crossref_primary_10_1145_3673908 crossref_primary_10_1007_s00158_025_03989_x crossref_primary_10_1007_s40996_025_02016_9 crossref_primary_10_1007_s12065_025_01027_9 crossref_primary_10_1109_TEVC_2022_3163843 crossref_primary_10_1097_MD_0000000000042910 crossref_primary_10_1145_3716638 crossref_primary_10_1109_TSMC_2024_3447051 crossref_primary_10_1109_TEVC_2022_3208595 crossref_primary_10_1016_j_envsoft_2021_105281 crossref_primary_10_1007_s12517_019_5012_x crossref_primary_10_1016_j_asoc_2022_109793 crossref_primary_10_1016_j_asoc_2022_109751 crossref_primary_10_1080_03081079_2023_2245124 crossref_primary_10_1007_s10044_023_01176_6 crossref_primary_10_1016_j_rineng_2025_103945 crossref_primary_10_1016_j_oceaneng_2024_117175 crossref_primary_10_1016_j_ins_2016_09_048 crossref_primary_10_1007_s00500_016_2091_4 crossref_primary_10_1016_j_ins_2024_120272 crossref_primary_10_1016_j_neucom_2020_02_113 crossref_primary_10_1016_j_asoc_2019_105869 crossref_primary_10_1016_j_cie_2020_106771 crossref_primary_10_1016_j_ins_2024_121842 crossref_primary_10_1007_s10994_021_06010_w crossref_primary_10_1016_j_eswa_2016_07_013 crossref_primary_10_1088_1742_6596_1515_3_032076 |
| Cites_doi | 10.1007/BF01165154 10.1007/978-3-642-32937-1_23 10.1016/0005-1098(63)90018-9 10.1111/itor.12001 10.1162/evco.2007.15.4.435 10.1007/s00500-011-0781-5 10.1016/S0004-3702(02)00363-6 10.1016/j.ejor.2012.11.046 10.1007/s10472-006-9036-z 10.1007/BF00202749 10.1023/A:1006314320276 10.1007/s10710-010-9110-5 10.1016/j.ins.2014.01.007 10.4018/jamc.2010040104 10.1109/ICEC.1997.592287 10.1016/j.artint.2013.10.003 10.1109/ICSCCW.2009.5379477 10.1162/106365600568095 10.1109/TEVC.2010.2040183 10.1016/B978-1-55860-356-1.50005-4 10.1007/978-3-540-30217-9_2 10.1109/MHS.1995.494215 10.1162/evco.1999.7.1.69 10.1109/4235.771166 10.1057/palgrave.jors.2601611 10.1109/4235.585893 10.1006/jtbi.1993.1120 10.1016/j.neucom.2013.05.035 10.1007/BF00175354 10.1109/MCS.2002.1004010 10.1145/1538902.1538906 10.1613/jair.3831 10.1613/jair.2861 10.1007/978-3-642-32937-1_41 10.1016/j.ins.2012.05.009 10.1080/00401706.1979.10489811 10.1007/s005000050009 10.1109/4235.918434 10.1162/106365602317301754 10.1016/j.asoc.2011.02.032 10.1016/j.ins.2014.03.105 10.1016/S0004-3702(00)00081-3 10.1145/1830761.1830790 10.1109/4235.843491 10.1016/j.asoc.2004.12.002 10.1162/EVCO_a_00096 10.1109/TEVC.2008.924428 10.1002/aic.690190413 10.1016/j.ins.2014.01.026 10.3233/HIS-2011-0133 10.1016/j.ins.2013.04.015 10.1007/s10472-011-9230-5 10.1109/CEC.2010.5585980 10.1016/j.cor.2013.11.015 10.1016/j.ins.2010.12.006 10.1162/evco.2007.15.2.169 10.1109/TEVC.2010.2059031 10.1109/CEC.2005.1554761 10.1016/j.artint.2010.07.005 10.1109/TEVC.2011.2132725 10.1109/CEC.2009.4983112 10.1162/1063656054088549 10.1007/s00453-008-9244-5 10.1137/S0895480199355225 10.1016/j.swevo.2011.08.003 10.1162/1063656041774956 10.1007/s00500-010-0639-2 10.1109/CEC.2012.6256490 10.1057/jors.2013.71 10.1016/j.knosys.2013.04.005 10.1007/BFb0056848 10.1063/1.3337690 10.1057/palgrave/jors/2601342 10.1609/aimag.v35i3.2460 10.1016/j.asoc.2011.03.001 10.1109/TEVC.2014.2302006 10.1016/j.asoc.2006.12.004 10.1007/BFb0026607 10.1016/j.swevo.2011.02.001 10.1023/A:1015059928466 10.1109/IJCNN.2008.4634391 10.1613/jair.2490 10.1145/1456650.1456656 10.1016/B978-0-08-050684-5.50005-7 10.1109/TEVC.2009.2021465 10.1109/ANZIIS.1996.573954 10.1007/978-3-642-44973-4_4 10.1007/s10462-009-9127-4 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier Inc. |
| Copyright_xml | – notice: 2015 Elsevier Inc. |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.ins.2015.05.010 |
| DatabaseName | CrossRef Computer and Information Systems 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 Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Library & Information Science Statistics |
| EISSN | 1872-6291 |
| EndPage | 245 |
| ExternalDocumentID | 10_1016_j_ins_2015_05_010 S0020025515003680 |
| GroupedDBID | --K --M --Z -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE ADGUI ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W JJJVA KOM LG9 LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SDF SDG SDP SES SPC SPCBC SSB SSD SST SSV SSW SSZ T5K TN5 TWZ WH7 XPP ZMT ~02 ~G- 1OL 29I 77I 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABEFU ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADJOM ADMUD ADNMO ADVLN AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HLZ HVGLF HZ~ H~9 R2- SBC SDS SEW UHS WUQ YYP ZY4 ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c439t-3da99a921b625fbfd68a399bdcfad106dc0cd9e96c1c4d5f20e2d90780c586c63 |
| ISICitedReferencesCount | 157 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000358093400014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0020-0255 |
| IngestDate | Thu Oct 02 04:54:26 EDT 2025 Tue Nov 18 22:11:29 EST 2025 Sat Nov 29 07:52:32 EST 2025 Fri Feb 23 02:23:14 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Algorithm selection Performance prediction Empirical performance models Exploratory landscape analysis Black-box continuous optimization Problem hardness measures |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c439t-3da99a921b625fbfd68a399bdcfad106dc0cd9e96c1c4d5f20e2d90780c586c63 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| OpenAccessLink | http://hdl.handle.net/11343/54982 |
| PQID | 1770333643 |
| PQPubID | 23500 |
| PageCount | 22 |
| ParticipantIDs | proquest_miscellaneous_1770333643 crossref_primary_10_1016_j_ins_2015_05_010 crossref_citationtrail_10_1016_j_ins_2015_05_010 elsevier_sciencedirect_doi_10_1016_j_ins_2015_05_010 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-10-01 2015-10-00 20151001 |
| PublicationDateYYYYMMDD | 2015-10-01 |
| PublicationDate_xml | – month: 10 year: 2015 text: 2015-10-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Information sciences |
| PublicationYear | 2015 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Bartz-Beielstein (b0035) 2006 Zadrozny (b0850) 2004 Eiben, Hinterding, Michalewicz (b0165) 1999; 3 Morgan, Gallagher (b0495) 2013; PP Leyton-Brown, Nudelman, Shoham (b0370) 2002; vol. 2470 Jansen (b0335) 2013 Thornton, Hutter, Hoos, Leyton-Brown (b0740) 2013 Lunacek, Whitley (b0415) 2006 Hansen, Ros, Mauny, Schoenauer, Auger (b0250) 2011; 11 X. Li, K. Tang, M. Omidvar, Z. Yang, K. Qin, H. China, Benchmark functions for the CEC’2013 special session and competition on large-scale global optimization, Tech. rep., RMIT University, 2013. T. Bartz-Beielstein, C. Lasarczyk, M. Preuß, Sequential parameter optimization, in: The 2005 IEEE Congress on Evolutionary Computation, vol. 1, 2005, pp. 773–780. Xu, Hutter, Hoos, Leyton-Brown (b0845) 2012; vol. 7317 Steer, Wirth, Halgamuge (b0720) 2008; vol. 5361 Müller, Sbalzarini (b0475) 2011; vol. 6624 Muñoz, Kirley, Halgamuge (b0515) 2015; 19 Eremeev, Reeves (b0180) 2003; vol. 2611 S. Rochet, M. Slimane, G. Venturini, Epistasis for real encoding in genetic algorithms, in: Australian and New Zealand Conference on Intelligent Information Systems, 1996, pp. 268–271. A. Moraglio, Towards a geometric unification of evolutionary algorithms, Ph.D. thesis, University of Essex, 2007. Hoos, Stützle (b0285) 2005 Watson, Beck, Howe, Whitley (b0790) 2003; 143 N. Gould, D. Orban, P. Toint, CUTEst: a constrained and unconstrained testing environment with safe threads, Tech. Rep. RAL-TR-2013-005, Science and Technology Facilities Council, 2013. Hutter, Hoos, Leyton-Brown (b0315) 2011; vol. 6683 Peng, Tang, Chen, Yao (b0575) 2010; 14 Caamaño, Prieto, Becerra, Bellas, Duro (b0100) 2010; vol. 6443 Naudts, Kallel (b0520) 2000; 4 Nocedal, Wright (b0545) 2006 Nocedal, Wright (b0550) 2006 Reeves, Eremeev (b0615) 2004; 55 . M. Muñoz, M. Kirley, S. Halgamuge, A meta-learning prediction model of algorithm performance for continuous optimization problems, in: Proceedings of Parallel Problem Solving from Nature (PPSN XII), Lect. Notes Comput. Sci., vol. 7941, 2012, pp. 226–235. Passino (b0565) 2002; 22 Jones, Forrest (b0340) 1995 Smith-Miles (b0685) 2009; 41 Cavazzuti (b0105) 2013 Michalewicz, vadis (b0470) 2012 Cavazzuti (b0110) 2013 Pappa, Ochoa, Hyde, Freitas, Woodward, Swan (b0560) 2013 Brooks, Durfee (b0085) 2003; vol. 2636 Smith-Miles, van Hemert (b0700) 2011; 61 Houle, Kriegel, Kröger, Schubert, Zimek (b0300) 2010; vol. 6187 Rice (b0625) 1976; vol. 15 Beck, Freuder (b0045) 2004; vol. 3011 Efron, Tibshirani (b0160) 1993 Malitsky, Sellmann (b0435) 2012; vol. 7298 R. Morgan, M. Gallagher, Length scale for characterising continuous optimization problems, in: Proceedings of Parallel Problem Solving from Nature (PPSN XII), Lect. Notes Comput. Sci., 2012, pp. 407–416. Y. Borenstein, R. Poli, Fitness distributions and GA hardness, in: Proceedings of Parallel Problem Solving from Nature (PPSN VIII), 2004, pp. 11–20. Kadioglu, Malitsky, Sellmann, Tierney (b0345) 2010 Weise, Zapf, Chiong, Nebro (b0810) 2009; vol. 193 Bischl, Mersmann, Trautmann, Preuß (b0070) 2012 Oliveto, Yao (b0555) 2011 Simon, Rarick, Ergezer, Du (b0665) 2011; 181 L. Xu, F. Hutter, H. Hoos, K. Leyton-Brown, Hydra-MIP: automated algorithm configuration and selection for mixed integer programming, in: Proceedings of the 18th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2011. Hart, Timmis (b0255) 2008; 8 M. Dorigo, V. Maniezzo, A. Colorni, Ant system: an autocatalytic optimizing process, Tech. Rep. 91-016, Politecnico di Milano, 1991. G. Uludag, A. Sima Uyar, Fitness landscape analysis of differential evolution algorithms, in: Fifth International Conference on Soft Computing, Computing with Words and Perceptions in System Analysis, Decision and Control, ICSCCW 2009, 2009, pp. 1–4. L. Xu, F. Hutter, H. Hoos, K. Leyton-brown, Satzilla2009: an automatic algorithm portfolio for sat. solver description, in: 2009 SAT Competition, 2009. Conn, Gould, Toint (b0120) 2000 Preuß, Stoean, Stoean (b0600) 2011 Leyton-Brown, Nudelman, Shoham (b0375) 2009; 56 Ansótegui, Sellmann, Tierney (b0020) 2009 Leyva, González, Pérez (b0385) 2013; 47 Birattari, Yuan, Balaprakash, Stützle (b0065) 2010 Vrugt, Robinson, Hyman (b0780) 2009; 13 Cortes, Mohri, Riley, Rostamizadeh (b0130) 2008; vol. 5254 Smith, Fogarty (b0670) 1997; 1 Beyer, Schwefel (b0060) 2002; 1 Hutter, Hoos, Leyton-Brown, Stützle (b0320) 2009; 36 Lozano, Molina, Herrera (b0405) 2011; 15 Mersmann, Preuß, Trautmann (b0460) 2010; vol. 6238 Marin (b0450) 2012; 16 Weinberger, Stadler (b0805) 1993; 163 Whitley (b0820) 1994; 4 N. Hansen, A. Auger, S. Finck, R. Ros, Real-parameter black-box optimization benchmarking BBOB-2010: Experimental setup, Tech. Rep. RR-7215, INRIA, September 2010. K. Price, Differential evolution vs. the functions of the 2nd ICEO, in: Proceedings of the IEEE International Conference on Evolutionary Computation, 1997, pp. 153–157. Sörensen (b0865) 2015; 22 P. Suganthan, N. Hansen, J. Liang, K. Deb, Y. Chen, A. Auger, S. Tiwari, Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization, Tech. rep., NTU, Singapore and IIT, Kanpur, 2005. Merz (b0465) 2004; 12 Naudts, Suys, Verschoren (b0525) 1997 Smith-Miles, Baatar, Wreford, Lewis (b0690) 2014; 45 Graff, Poli, Flores (b0230) 2013; 21 Leyva, Caises, González, Pérez (b0380) 2014; 266 Seo, Moon (b0660) 2007; 15 Howe, Dahlman, Hansen, Scheetz, Mayrhauser (b0305) 2000; vol. 1809 J. Watson, A. Howe, Focusing on the individual: Why we need new empirical methods for characterizing problem difficulty, Working Notes of ECAI 2000 Workshop on Empirical Methods in Artificial Intelligence, August 2000. Blum, Puchinger, Raidl, Roli (b0075) 2011; 11 Hutter, Xu, Hoos, Leyton-Brown (b0325) 2014; 206 R. Eberhart, J. Kennedy, A new optimizer using particle swarm theory, in: Sixth International Symposium on Micro Machine and Human Science, 1995, pp. 39–43. Tomassini, Vanneschi, Collard, Clergue (b0745) 2005; 13 Karnopp (b0360) 1963; 1 Lu, Li, Yao (b0410) 2011 Reeves, Wright (b0620) 1995 Malitsky, Sabharwal, Samulowitz, Sellmann (b0440) 2011; vol. 6695 C. Fonlupt, D. Robilliard, P. Preux, A bit-wise epistasis measure for binary search spaces, in: Proceedings of Parallel Problem Solving from Nature (PPSN V), Lect. Notes Comput. Sci., vol. 1498, 1998, pp. 47–56. Montes de Oca, Stutzle, Birattari, Dorigo (b0480) 2009; 13 Graff, Poli (b0225) 2010; 174 T. Abell, Y. Malitsky, K. Tierney, Features for exploiting black-box optimization problem structure, in: Proceedings of the 7th International Conference on Learning and Intelligence Optimization (LION7), Lect. Notes Comput. Sci., 2013, pp. 30–36. Wolpert, Macready (b0825) 1997; 1 Bergstra, Bengio (b0055) 2012; 13 Karaboga, Akay (b0355) 2009; 31 Garnier, Kallel (b0200) 2002; 15 Xu, Hutter, Hoos, Leyton-Brown (b0830) 2008; 32 M. Pedersen, Tuning & simplifying heuristical optimization, Ph.D. thesis, University of Southampton, 2009. J. Rice, Methodology for the algorithm selection problem, in: Proceedings of the IFIP TC 2.5 Working Conference on Performance Evaluation of Numerical Software, 1979, pp. 301–307. Burke, Hyde, Kendall, Ochoa, Ozcan, Qu (b0090) 2013; 64 Rosé, Ebeling, Asselmeyer (b0650) 1996; vol. 1141 Wang, Song, Sun, Zhang, Xu, Zhou (b0785) 2013; 47 Mersmann, Bischl, Trautmann, Preuß, Weihs, Rudolph (b0455) 2011 Hutter, Hamadi, Hoos, Leyton-Brown (b0310) 2006; vol. 4204 Graff, Escalante, Cerda-Jacobo, Gonzalez (b0220) 2013; 122 X. Li, A. Engelbrecht, M. Epitropakis, Benchmark functions for CEC’2013 special session and competition on niching methods for multimodal function optimization, Tech. rep., RMIT University, 2013. Poli, Vanneschi, Langdon, McPhee (b0595) 2010; 11 Eiben, Michalewicz, Schoenauer, Smith (b0170) 2005; vol. 54 Kotthoff (b0860) 2014; 35 Luus, Jaakola (b0420) 1973; 19 Gomes, Selman, Crato, Kautz (b0210) 2000; 24 Caamaño, Bellas, Becerra, Duro (b0095) 2013 J. Grobler, A. Engelbrecht, G. Kendall, V. Yadavalli, Alternative hyper-heuristic strategies for multi-method global optimization, in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC2010), 2010, pp. 1–8. Neumann, Witt (b0530) 2010 Stephens, Poli (b0725) 2004; vol. 11 Henderson, Jacobson, Johnson (b0275) 2003; vol. 57 Auger, Doerr (b0025) 2011 M. Hilario, A. Kalousis, P. Nguyen, A. Woznica, A data mining ontology for algorithm selection and meta-mining, in: Third Generation Data Mining: Towards Service-Oriented Knowledge Discovery, 2009, pp. 76–87. P. Hough, P. Williams, Modern machine learning for automatic optimization algorithm selection, in: Proceedings of the INFORMS Artificial Intelligence and Data Mining Workshop, 2006, pp. 1–6. Malan, Engelbrecht (b0430) 2013; 241 J. Beck, J. Watson, Adaptive search algorithms and fitness–distance correlation, in: Proceedings of the Fifth Metaheuristics International Conference, 2003, pp. 1–6. Zakynthinaki, Stirling, Martínez, de Durana, Quintana, Romo, Molinuevo (b0855) 2010; 20 S. Rochet, G. Venturini, M. Slimane, E. El Kharoubi, A critical and empirical study of epistasis measures for predicting ga performances: a summary, in: Third European Conference on Artificial Evolution, 1998, pp. 275–285. R. Ros, Real-parameter black-box optimisation: Benchmarking and designing algorithms, Ph.D. thesis, Universite Paris-Sud, December 2009. Chen, Ong, Lim, Tan (b0115) 2011; 15 Das, Suganthan (b0135) 2011; 15 Gagliolo, Schmidhuber (b0195) 2006; 47 M. Muñoz, M. Kirley, S. Halgamuge, Landscape characterization of numerical optimization problems using biased scattered data, in: Proceedings of the 2012 Congress on Evolutionary Computation (CEC2012), 2012, pp. 1–8. Davidor (b0140) 1991 Heckendorn, Whitley (b0270) 1999; 7 Vassilev, Fogarty, Miller (b0765) 2000; 8 Smith-Miles, Wreford, Lopes, Insani (b0705) 2013; vol. 434 Ali, Smith (b0010) 2006; 6 Corte, Sörensen (b0125) 2013; 228 Muñoz, Kirley, Halgamuge (b0500) 2012; vol. 445 Eiben, Smit (b0175) 2011; 1 Hoos, Stützle (b0290) 2005 Smith-Miles, James, Giffin, Tu (b0695) 2009; vol. 5851 Weinberger (b0800) 1990; 63 Vassilevska, Williams, Woo (b0770) 2006 Liu, Yao, Zhao, Higuchi (b04 Cavazzuti (10.1016/j.ins.2015.05.010_b0105) 2013 10.1016/j.ins.2015.05.010_b0240 Leyva (10.1016/j.ins.2015.05.010_b0385) 2013; 47 Wang (10.1016/j.ins.2015.05.010_b0785) 2013; 47 10.1016/j.ins.2015.05.010_b0640 Bischl (10.1016/j.ins.2015.05.010_b0070) 2012 10.1016/j.ins.2015.05.010_b0485 10.1016/j.ins.2015.05.010_b0245 Karnopp (10.1016/j.ins.2015.05.010_b0360) 1963; 1 Schmee (10.1016/j.ins.2015.05.010_b0655) 1979; 21 10.1016/j.ins.2015.05.010_b0005 Xu (10.1016/j.ins.2015.05.010_b0830) 2008; 32 10.1016/j.ins.2015.05.010_b0645 Hutter (10.1016/j.ins.2015.05.010_b0310) 2006; vol. 4204 Hutter (10.1016/j.ins.2015.05.010_b0315) 2011; vol. 6683 Reeves (10.1016/j.ins.2015.05.010_b0620) 1995 Eiben (10.1016/j.ins.2015.05.010_b0175) 2011; 1 Jones (10.1016/j.ins.2015.05.010_b0340) 1995 Luus (10.1016/j.ins.2015.05.010_b0420) 1973; 19 Watson (10.1016/j.ins.2015.05.010_b0790) 2003; 143 Preuß (10.1016/j.ins.2015.05.010_b0600) 2011 Rice (10.1016/j.ins.2015.05.010_b0625) 1976; vol. 15 Tang (10.1016/j.ins.2015.05.010_b0735) 2014; 279 10.1016/j.ins.2015.05.010_b0080 Jansen (10.1016/j.ins.2015.05.010_b0335) 2013 Weinberger (10.1016/j.ins.2015.05.010_b0805) 1993; 163 Bartz-Beielstein (10.1016/j.ins.2015.05.010_b0035) 2006 Vanneschi (10.1016/j.ins.2015.05.010_b0760) 2003; vol. 2610 Gomes (10.1016/j.ins.2015.05.010_b0210) 2000; 24 Howe (10.1016/j.ins.2015.05.010_b0305) 2000; vol. 1809 Henderson (10.1016/j.ins.2015.05.010_b0275) 2003; vol. 57 Thornton (10.1016/j.ins.2015.05.010_b0740) 2013 Graff (10.1016/j.ins.2015.05.010_b0220) 2013; 122 10.1016/j.ins.2015.05.010_b0750 10.1016/j.ins.2015.05.010_b0235 10.1016/j.ins.2015.05.010_b0510 Marin (10.1016/j.ins.2015.05.010_b0450) 2012; 16 10.1016/j.ins.2015.05.010_b0630 Chen (10.1016/j.ins.2015.05.010_b0115) 2011; 15 Graff (10.1016/j.ins.2015.05.010_b0225) 2010; 174 Seo (10.1016/j.ins.2015.05.010_b0660) 2007; 15 10.1016/j.ins.2015.05.010_b0635 Neumann (10.1016/j.ins.2015.05.010_b0530) 2010 Ansótegui (10.1016/j.ins.2015.05.010_b0020) 2009 De Jong (10.1016/j.ins.2015.05.010_b0145) 2005; vol. 54 Mersmann (10.1016/j.ins.2015.05.010_b0455) 2011 Steer (10.1016/j.ins.2015.05.010_b0720) 2008; vol. 5361 Eremeev (10.1016/j.ins.2015.05.010_b0180) 2003; vol. 2611 Lu (10.1016/j.ins.2015.05.010_b0410) 2011 Muñoz (10.1016/j.ins.2015.05.010_b0500) 2012; vol. 445 Poli (10.1016/j.ins.2015.05.010_b0595) 2010; 11 Smith-Miles (10.1016/j.ins.2015.05.010_b0690) 2014; 45 Weise (10.1016/j.ins.2015.05.010_b0810) 2009; vol. 193 Zadrozny (10.1016/j.ins.2015.05.010_b0850) 2004 Weyland (10.1016/j.ins.2015.05.010_b0815) 2010; 1 Efron (10.1016/j.ins.2015.05.010_b0160) 1993 Naudts (10.1016/j.ins.2015.05.010_b0520) 2000; 4 Francois (10.1016/j.ins.2015.05.010_b0190) 2001; 5 Cavazzuti (10.1016/j.ins.2015.05.010_b0110) 2013 Leyton-Brown (10.1016/j.ins.2015.05.010_b0375) 2009; 56 Vassilevska (10.1016/j.ins.2015.05.010_b0770) 2006 10.1016/j.ins.2015.05.010_b0425 Vassilev (10.1016/j.ins.2015.05.010_b0765) 2000; 8 Smith-Miles (10.1016/j.ins.2015.05.010_b0695) 2009; vol. 5851 Nocedal (10.1016/j.ins.2015.05.010_b0545) 2006 Corte (10.1016/j.ins.2015.05.010_b0125) 2013; 228 Gagliolo (10.1016/j.ins.2015.05.010_b0195) 2006; 47 Michalewicz (10.1016/j.ins.2015.05.010_b0470) 2012 Peng (10.1016/j.ins.2015.05.010_b0575) 2010; 14 Kadioglu (10.1016/j.ins.2015.05.010_b0345) 2010 Whitley (10.1016/j.ins.2015.05.010_b0820) 1994; 4 Smith-Miles (10.1016/j.ins.2015.05.010_b0685) 2009; 41 Sörensen (10.1016/j.ins.2015.05.010_b0865) 2015; 22 Zakynthinaki (10.1016/j.ins.2015.05.010_b0855) 2010; 20 10.1016/j.ins.2015.05.010_b0490 Auger (10.1016/j.ins.2015.05.010_b0025) 2011 Leyton-Brown (10.1016/j.ins.2015.05.010_b0370) 2002; vol. 2470 Nocedal (10.1016/j.ins.2015.05.010_b0550) 2006 Burke (10.1016/j.ins.2015.05.010_b0090) 2013; 64 Mersmann (10.1016/j.ins.2015.05.010_b0460) 2010; vol. 6238 Oliveto (10.1016/j.ins.2015.05.010_b0555) 2011 Garnier (10.1016/j.ins.2015.05.010_b0200) 2002; 15 10.1016/j.ins.2015.05.010_b0040 Pitzer (10.1016/j.ins.2015.05.010_b0590) 2012; vol. 378 Hoos (10.1016/j.ins.2015.05.010_b0285) 2005 He (10.1016/j.ins.2015.05.010_b0265) 2007; 15 10.1016/j.ins.2015.05.010_b0680 Stephens (10.1016/j.ins.2015.05.010_b0725) 2004; vol. 11 Davidor (10.1016/j.ins.2015.05.010_b0140) 1991 10.1016/j.ins.2015.05.010_b0840 Hauschild (10.1016/j.ins.2015.05.010_b0260) 2011; 1 Beyer (10.1016/j.ins.2015.05.010_b0060) 2002; 1 Reeves (10.1016/j.ins.2015.05.010_b0610) 2005 Ali (10.1016/j.ins.2015.05.010_b0010) 2006; 6 Hart (10.1016/j.ins.2015.05.010_b0255) 2008; 8 Lunacek (10.1016/j.ins.2015.05.010_b0415) 2006 Rosé (10.1016/j.ins.2015.05.010_b0650) 1996; vol. 1141 Anderson (10.1016/j.ins.2015.05.010_b0015) 2002; 53 10.1016/j.ins.2015.05.010_b0280 Wolpert (10.1016/j.ins.2015.05.010_b0825) 1997; 1 10.1016/j.ins.2015.05.010_b0150 Hansen (10.1016/j.ins.2015.05.010_b0250) 2011; 11 Müller (10.1016/j.ins.2015.05.010_b0475) 2011; vol. 6624 Tomassini (10.1016/j.ins.2015.05.010_b0745) 2005; 13 10.1016/j.ins.2015.05.010_b0395 Malitsky (10.1016/j.ins.2015.05.010_b0435) 2012; vol. 7298 Naudts (10.1016/j.ins.2015.05.010_b0525) 1997 Piotrowski (10.1016/j.ins.2015.05.010_b0580) 2014; 267 10.1016/j.ins.2015.05.010_b0155 Morgan (10.1016/j.ins.2015.05.010_b0495) 2013; PP Auger (10.1016/j.ins.2015.05.010_b0030) 2010; 57 10.1016/j.ins.2015.05.010_b0795 Smith-Miles (10.1016/j.ins.2015.05.010_b0705) 2013; vol. 434 Kotthoff (10.1016/j.ins.2015.05.010_b0860) 2014; 35 Stadler (10.1016/j.ins.2015.05.010_b0715) 1996; 20 10.1016/j.ins.2015.05.010_b0835 Montes de Oca (10.1016/j.ins.2015.05.010_b0480) 2009; 13 Malitsky (10.1016/j.ins.2015.05.010_b0440) 2011; vol. 6695 Malitsky (10.1016/j.ins.2015.05.010_b0445) 2013 Nocedal (10.1016/j.ins.2015.05.010_b0540) 2006 Smith-Miles (10.1016/j.ins.2015.05.010_b0700) 2011; 61 Bergstra (10.1016/j.ins.2015.05.010_b0055) 2012; 13 Gomes (10.1016/j.ins.2015.05.010_b0205) 2001; 126 10.1016/j.ins.2015.05.010_b0390 10.1016/j.ins.2015.05.010_b0185 Simon (10.1016/j.ins.2015.05.010_b0665) 2011; 181 Birattari (10.1016/j.ins.2015.05.010_b0065) 2010 10.1016/j.ins.2015.05.010_b0585 Vanneschi (10.1016/j.ins.2015.05.010_b0755) 2004; vol. 3103 Hoos (10.1016/j.ins.2015.05.010_b0290) 2005 Hutter (10.1016/j.ins.2015.05.010_b0325) 2014; 206 Beck (10.1016/j.ins.2015.05.010_b0045) 2004; vol. 3011 Xu (10.1016/j.ins.2015.05.010_b0845) 2012; vol. 7317 10.1016/j.ins.2015.05.010_b0505 Caamaño (10.1016/j.ins.2015.05.010_b0095) 2013 Nocedal (10.1016/j.ins.2015.05.010_b0535) 2006 Merz (10.1016/j.ins.2015.05.010_b0465) 2004; 12 Heckendorn (10.1016/j.ins.2015.05.010_b0270) 1999; 7 Leyva (10.1016/j.ins.2015.05.010_b0380) 2014; 266 Vrugt (10.1016/j.ins.2015.05.010_b0780) 2009; 13 Weinberger (10.1016/j.ins.2015.05.010_b0800) 1990; 63 Smith (10.1016/j.ins.2015.05.010_b0675) 2002; 10 Graff (10.1016/j.ins.2015.05.010_b0230) 2013; 21 Houle (10.1016/j.ins.2015.05.010_b0300) 2010; vol. 6187 Karaboga (10.1016/j.ins.2015.05.010_b0355) 2009; 31 10.1016/j.ins.2015.05.010_b0050 Eiben (10.1016/j.ins.2015.05.010_b0165) 1999; 3 10.1016/j.ins.2015.05.010_b0295 10.1016/j.ins.2015.05.010_b0570 10.1016/j.ins.2015.05.010_b0330 Malan (10.1016/j.ins.2015.05.010_b0430) 2013; 241 Pappa (10.1016/j.ins.2015.05.010_b0560) 2013 Caamaño (10.1016/j.ins.2015.05.010_b0100) 2010; vol. 6443 Conn (10.1016/j.ins.2015.05.010_b0120) 2000 Das (10.1016/j.ins.2015.05.010_b0135) 2011; 15 Črepinšek (10.1016/j.ins.2015.05.010_b0775) 2012; 212 10.1016/j.ins.2015.05.010_b0730 10.1016/j.ins.2015.05.010_b0215 Lozano (10.1016/j.ins.2015.05.010_b0405) 2011; 15 Brooks (10.1016/j.ins.2015.05.010_b0085) 2003; vol. 2636 Cortes (10.1016/j.ins.2015.05.010_b0130) 2008; vol. 5254 Blum (10.1016/j.ins.2015.05.010_b0075) 2011; 11 Kanda (10.1016/j.ins.2015.05.010_b0350) 2011; 8 Reeves (10.1016/j.ins.2015.05.010_b0615) 2004; 55 10.1016/j.ins.2015.05.010_b0605 Passino (10.1016/j.ins.2015.05.010_b0565) 2002; 22 Liu (10.1016/j.ins.2015.05.010_b0400) 2001; vol. 2 Muñoz (10.1016/j.ins.2015.05.010_b0515) 2015; 19 Hutter (10.1016/j.ins.2015.05.010_b0320) 2009; 36 Eiben (10.1016/j.ins.2015.05.010_b0170) 2005; vol. 54 Smith (10.1016/j.ins.2015.05.010_b0670) 1997; 1 |
| References_xml | – year: 2013 ident: b0110 article-title: Stochastic Optimization – start-page: 108 year: 2011 end-page: 117 ident: b0410 article-title: Fitness–probability cloud and a measure of problem hardness for evolutionary algorithms publication-title: Proceedings of the 11th European Conference on Evolutionary Computation in Combinatorial Optimization – reference: K. Price, Differential evolution vs. the functions of the 2nd ICEO, in: Proceedings of the IEEE International Conference on Evolutionary Computation, 1997, pp. 153–157. – reference: X. Li, A. Engelbrecht, M. Epitropakis, Benchmark functions for CEC’2013 special session and competition on niching methods for multimodal function optimization, Tech. rep., RMIT University, 2013. – volume: 228 start-page: 1 year: 2013 end-page: 10 ident: b0125 article-title: Optimisation of gravity-fed water distribution network design: a critical review publication-title: Eur. J. Oper. Res. – volume: 35 year: 2014 ident: b0860 article-title: Algorithm selection for combinatorial search problems: a survey publication-title: AI Magazine – start-page: 66 year: 2006 end-page: 100 ident: b0550 article-title: Trust-region methods publication-title: Numerical Optimization – reference: N. Gould, D. Orban, P. Toint, CUTEst: a constrained and unconstrained testing environment with safe threads, Tech. Rep. RAL-TR-2013-005, Science and Technology Facilities Council, 2013. – volume: 6 start-page: 119 year: 2006 end-page: 138 ident: b0010 article-title: On learning algorithm selection for classification publication-title: Appl. Soft Comput. – volume: 1 start-page: 81 year: 1997 end-page: 87 ident: b0670 article-title: Operator and parameter adaptation in genetic algorithms publication-title: Soft Comput. – year: 1993 ident: b0160 article-title: An Introduction to the Bootstrap – reference: M. Muñoz, M. Kirley, S. Halgamuge, Landscape characterization of numerical optimization problems using biased scattered data, in: Proceedings of the 2012 Congress on Evolutionary Computation (CEC2012), 2012, pp. 1–8. – volume: vol. 193 start-page: 1 year: 2009 end-page: 50 ident: b0810 article-title: Why is optimization difficult? publication-title: Nature-Inspired Algorithms for Optimisation – reference: P. Hough, P. Williams, Modern machine learning for automatic optimization algorithm selection, in: Proceedings of the INFORMS Artificial Intelligence and Data Mining Workshop, 2006, pp. 1–6. – volume: vol. 4204 start-page: 213 year: 2006 end-page: 228 ident: b0310 article-title: Performance prediction and automated tuning of randomized and parametric algorithms publication-title: Proceedings of Principles and Practice of Constraint Programming – CP 2006 – reference: M. Hilario, A. Kalousis, P. Nguyen, A. Woznica, A data mining ontology for algorithm selection and meta-mining, in: Third Generation Data Mining: Towards Service-Oriented Knowledge Discovery, 2009, pp. 76–87. – reference: Y. Borenstein, R. Poli, Fitness distributions and GA hardness, in: Proceedings of Parallel Problem Solving from Nature (PPSN VIII), 2004, pp. 11–20. – volume: vol. 5851 start-page: 89 year: 2009 end-page: 103 ident: b0695 article-title: A knowledge discovery approach to understanding relationships between scheduling problem structure and heuristic performance publication-title: Learning and Intelligent Optimization – volume: 16 start-page: 683 year: 2012 end-page: 698 ident: b0450 article-title: How landscape ruggedness influences the performance of real-coded algorithms: a comparative study publication-title: Soft Comput. – volume: vol. 1809 start-page: 62 year: 2000 end-page: 72 ident: b0305 article-title: Exploiting competitive planner performance publication-title: Recent Advances in AI Planning – reference: J. Watson, A. Howe, Focusing on the individual: Why we need new empirical methods for characterizing problem difficulty, Working Notes of ECAI 2000 Workshop on Empirical Methods in Artificial Intelligence, August 2000. – volume: vol. 54 start-page: 19 year: 2005 end-page: 46 ident: b0170 article-title: Parameter control in evolutionary algorithms publication-title: Parameter Setting in Evolutionary Algorithms – start-page: 114 year: 2004 ident: b0850 article-title: Learning and evaluating classifiers under sample selection bias publication-title: Proceedings of the Twenty-first International Conference on Machine Learning – start-page: 98 year: 2012 end-page: 121 ident: b0470 article-title: evolutionary computation? on a growing gap between theory and practice publication-title: Advances in Computational Intelligence – volume: 241 start-page: 148 year: 2013 end-page: 163 ident: b0430 article-title: A survey of techniques for characterising fitness landscapes and some possible ways forward publication-title: Inform. Sci. – reference: P. Suganthan, N. Hansen, J. Liang, K. Deb, Y. Chen, A. Auger, S. Tiwari, Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization, Tech. rep., NTU, Singapore and IIT, Kanpur, 2005. < – reference: J. Beck, J. Watson, Adaptive search algorithms and fitness–distance correlation, in: Proceedings of the Fifth Metaheuristics International Conference, 2003, pp. 1–6. – reference: K. Smith-Miles, Towards insightful algorithm selection for optimisation using meta-learning concepts, in: IEEE International Joint Conference on Neural Networks, 2008 (IJCNN 2008), (IEEE World Congress on Computational Intelligence), 2008, pp. 4118–4124. – volume: 47 start-page: 295 year: 2006 end-page: 328 ident: b0195 article-title: Learning dynamic algorithm portfolios publication-title: Ann. Math. Artif. Intel. – volume: 8 start-page: 191 year: 2008 end-page: 201 ident: b0255 article-title: Application areas of ais: the past, the present and the future publication-title: Appl. Soft Comput. – reference: R. Eberhart, J. Kennedy, A new optimizer using particle swarm theory, in: Sixth International Symposium on Micro Machine and Human Science, 1995, pp. 39–43. – reference: N. Hansen, A. Auger, S. Finck, R. Ros, Real-parameter black-box optimization benchmarking BBOB-2010: Experimental setup, Tech. Rep. RR-7215, INRIA, September 2010. – start-page: 477 year: 2006 end-page: 484 ident: b0415 article-title: The dispersion metric and the CMA evolution strategy publication-title: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation – volume: 57 start-page: 121 year: 2010 end-page: 146 ident: b0030 article-title: Continuous lunches are free plus the design of optimal optimization algorithms publication-title: Algorithmica – reference: T. Abell, Y. Malitsky, K. Tierney, Features for exploiting black-box optimization problem structure, in: Proceedings of the 7th International Conference on Learning and Intelligence Optimization (LION7), Lect. Notes Comput. Sci., 2013, pp. 30–36. – volume: 64 start-page: 1695 year: 2013 end-page: 1724 ident: b0090 article-title: Hyper-heuristics: a survey of the state of the art publication-title: J. Oper. Res. Soc. – volume: 1 start-page: 111 year: 1963 end-page: 121 ident: b0360 article-title: Random search techniques for optimization problems publication-title: Automatica – volume: vol. 6443 start-page: 567 year: 2010 end-page: 574 ident: b0100 article-title: Real-valued multimodal fitness landscape characterization for evolution publication-title: Neural Information Processing. Theory and Algorithms – volume: vol. 378 start-page: 161 year: 2012 end-page: 191 ident: b0590 article-title: A comprehensive survey on fitness landscape analysis publication-title: Recent Advances in Intelligent Engineering Systems – volume: 11 start-page: 5755 year: 2011 end-page: 5769 ident: b0250 article-title: Impacts of invariance in search: when CMA-ES and PSO face ill-conditioned and non-separable problems publication-title: Appl. Soft Comput. – reference: M. Muñoz, M. Kirley, S. Halgamuge, A meta-learning prediction model of algorithm performance for continuous optimization problems, in: Proceedings of Parallel Problem Solving from Nature (PPSN XII), Lect. Notes Comput. Sci., vol. 7941, 2012, pp. 226–235. – reference: G. Uludag, A. Sima Uyar, Fitness landscape analysis of differential evolution algorithms, in: Fifth International Conference on Soft Computing, Computing with Words and Perceptions in System Analysis, Decision and Control, ICSCCW 2009, 2009, pp. 1–4. – volume: 15 start-page: 4 year: 2011 end-page: 31 ident: b0135 article-title: Differential evolution: a survey of the state-of-the-art publication-title: IEEE Trans. Evol. Comput. – volume: 122 start-page: 375 year: 2013 end-page: 385 ident: b0220 article-title: Models of performance of time series forecasters publication-title: Neurocomputing – volume: 279 start-page: 94 year: 2014 end-page: 104 ident: b0735 article-title: Population-based algorithm portfolios with automated constituent algorithms selection publication-title: Inform. Sci. – volume: vol. 2610 start-page: 455 year: 2003 end-page: 464 ident: b0760 article-title: Fitness distance correlation in structural mutation genetic programming publication-title: Genetic Programming – volume: 22 start-page: 3 year: 2015 end-page: 18 ident: b0865 article-title: Metaheuristics—the metaphor exposed publication-title: Int. T. Oper. Res. – volume: 47 start-page: 1 year: 2013 end-page: 34 ident: b0785 article-title: A feature subset selection algorithm automatic recommendation method publication-title: J. Artif. Intell. Res. – volume: vol. 6624 start-page: 294 year: 2011 end-page: 303 ident: b0475 article-title: Global characterization of the CEC 2005 fitness landscapes using fitness–distance analysis publication-title: Applications of Evolutionary Computation – volume: vol. 2 start-page: 1101 year: 2001 end-page: 1108 ident: b0400 article-title: Scaling up fast evolutionary programming with cooperative coevolution publication-title: Proceedings of the 2001 Congress on Evolutionary Computation – year: 2010 ident: b0530 article-title: Bioinspired Computation in Combinatorial Optimization – start-page: 101 year: 2006 end-page: 134 ident: b0535 article-title: Conjugate gradient methods publication-title: Numerical Optimization – volume: vol. 11 start-page: 129 year: 2004 end-page: 155 ident: b0725 article-title: EC theory – “in theory” publication-title: Frontiers of Evolutionary Computation – reference: C. Fonlupt, D. Robilliard, P. Preux, A bit-wise epistasis measure for binary search spaces, in: Proceedings of Parallel Problem Solving from Nature (PPSN V), Lect. Notes Comput. Sci., vol. 1498, 1998, pp. 47–56. – start-page: 837 year: 2011 end-page: 844 ident: b0600 article-title: Niching foundations: basin identification on fixed-property generated landscapes publication-title: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation – start-page: 7 year: 1995 end-page: 22 ident: b0620 article-title: An experimental design perspective on genetic algorithms publication-title: Foundations of Genetic Algorithms 3 – volume: vol. 2470 start-page: 91 year: 2002 end-page: 100 ident: b0370 article-title: Learning the empirical hardness of optimization problems: the case of combinatorial auctions publication-title: Principles and Practice of Constraint Programming – CP 2002 – volume: 13 start-page: 1120 year: 2009 end-page: 1132 ident: b0480 article-title: Frankenstein’s PSO: a composite particle swarm optimization algorithm publication-title: IEEE Trans. Evol. Comput. – volume: vol. 434 start-page: 417 year: 2013 end-page: 432 ident: b0705 article-title: Predicting metaheuristic performance on graph coloring problems using data mining publication-title: Hybrid Metaheuristics – volume: 1 start-page: 50 year: 2010 end-page: 60 ident: b0815 article-title: A rigorous analysis of the harmony search algorithm: how the research community can be misled by a “novel” methodology publication-title: Int. J. Appl. Metaheur. Comput. – volume: 22 start-page: 52 year: 2002 end-page: 67 ident: b0565 article-title: Biomimicry of bacterial foraging for distributed optimization and control publication-title: IEEE Control Syst. Mag. – volume: 15 start-page: 169 year: 2007 end-page: 198 ident: b0660 article-title: An information-theoretic analysis on the interactions of variables in combinatorial optimization problems publication-title: Evol. Comput. – reference: R. Ros, Real-parameter black-box optimisation: Benchmarking and designing algorithms, Ph.D. thesis, Universite Paris-Sud, December 2009. – volume: 163 start-page: 255 year: 1993 end-page: 275 ident: b0805 article-title: Why some fitness landscapes are fractal publication-title: J. Theor. Biol. – volume: vol. 7298 start-page: 244 year: 2012 end-page: 259 ident: b0435 article-title: Instance-specific algorithm configuration as a method for non-model-based portfolio generation publication-title: Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems – volume: vol. 6683 start-page: 507 year: 2011 end-page: 523 ident: b0315 article-title: Sequential model-based optimization for general algorithm configuration publication-title: Learning and Intelligent Optimization – start-page: 21 year: 2011 end-page: 52 ident: b0555 article-title: Runtime analysis of evolutionary algorithms for discrete optimization publication-title: Theory of Randomized Search Heuristics – volume: 1 start-page: 3 year: 2002 end-page: 52 ident: b0060 article-title: Evolution strategies: a comprehensive introduction publication-title: Nat. Comput. – volume: 266 start-page: 16 year: 2014 end-page: 30 ident: b0380 article-title: On the use of meta-learning for instance selection: an architecture and an experimental study publication-title: Inform. Sci. – year: 2000 ident: b0120 article-title: Trust Region Methods – reference: A. Moraglio, Towards a geometric unification of evolutionary algorithms, Ph.D. thesis, University of Essex, 2007. – volume: 174 start-page: 1254 year: 2010 end-page: 1276 ident: b0225 article-title: Practical performance models of algorithms in evolutionary program induction and other domains publication-title: Artif. Intell. – volume: 21 start-page: 533 year: 2013 end-page: 560 ident: b0230 article-title: Models of performance of evolutionary program induction algorithms based on indicators of problem difficulty publication-title: Evol. Comput. – reference: K. Malan, A. Engelbrecht, Quantifying ruggedness of continuous landscapes using entropy, in: Proceedings of the 2009 IEEE Congress on Evolutionary Computation (CEC2009), 2009, pp. 1440–1447. – volume: 11 start-page: 285 year: 2010 end-page: 320 ident: b0595 article-title: Theoretical results in genetic programming: the next ten years? publication-title: Genet. Program. Evolvable Mach. – start-page: 23 year: 1991 end-page: 35 ident: b0140 article-title: Epistasis variance: a viewpoint on ga-hardness publication-title: Foundations of Genetic Algorithms – volume: 5 start-page: 129 year: 2001 end-page: 148 ident: b0190 article-title: Design of evolutionary algorithms – a statistical perspective publication-title: IEEE Trans. Evol. Comput. – volume: 206 start-page: 79 year: 2014 end-page: 111 ident: b0325 article-title: Algorithm runtime prediction: methods & evaluation publication-title: Artif. Intell. – volume: vol. 5254 start-page: 38 year: 2008 end-page: 53 ident: b0130 article-title: Sample selection bias correction theory publication-title: Algorithmic Learning Theory – volume: PP year: 2013 ident: b0495 article-title: Sampling techniques and distance metrics in high dimensional continuous landscape analysis: limitations and improvements publication-title: IEEE Trans. Evol. Comput. – volume: vol. 54 start-page: 1 year: 2005 end-page: 18 ident: b0145 article-title: Parameter setting in EAs: a 30 year perspective publication-title: Parameter Setting in Evolutionary Algorithms – year: 2013 ident: b0105 article-title: Deterministic Optimization – start-page: 608 year: 2013 end-page: 614 ident: b0445 article-title: Algorithm portfolios based on cost-sensitive hierarchical clustering publication-title: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence – reference: S. Rochet, M. Slimane, G. Venturini, Epistasis for real encoding in genetic algorithms, in: Australian and New Zealand Conference on Intelligent Information Systems, 1996, pp. 268–271. – start-page: 10 year: 2006 end-page: 29 ident: b0540 article-title: Fundamentals of unconstrained optimization publication-title: Numerical Optimization – start-page: 311 year: 2010 end-page: 336 ident: b0065 article-title: F-Race and iterated F-Race: an overview publication-title: Experimental Methods for the Analysis of Optimization Algorithms – volume: vol. 57 start-page: 287 year: 2003 end-page: 319 ident: b0275 article-title: The theory and practice of simulated annealing publication-title: Handbook of Metaheuristics – volume: 181 start-page: 1224 year: 2011 end-page: 1248 ident: b0665 article-title: Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms publication-title: Inform. Sci. – volume: 20 start-page: 1 year: 1996 end-page: 45 ident: b0715 article-title: Landscapes and their correlation functions publication-title: J. Math. Chem. – start-page: 1 year: 2006 end-page: 10 ident: b0770 article-title: Confronting hardness using a hybrid approach publication-title: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm – volume: 8 start-page: 117 year: 2011 end-page: 128 ident: b0350 article-title: Selection of algorithms to solve traveling salesman problems using meta-learning publication-title: Int. J. Hybrid Intell. Syst. – year: 2006 ident: b0035 publication-title: Experimental Research in Evolutionary Computation – volume: 24 start-page: 67 year: 2000 end-page: 100 ident: b0210 article-title: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems publication-title: J. Autom. Reason. – volume: 212 start-page: 79 year: 2012 end-page: 93 ident: b0775 article-title: A note on teaching-learning-based optimization algorithm publication-title: Inform. Sci. – volume: 1 start-page: 19 year: 2011 end-page: 31 ident: b0175 article-title: Parameter tuning for configuring and analyzing evolutionary algorithms publication-title: Swarm Evol. Comput. – reference: J. Grobler, A. Engelbrecht, G. Kendall, V. Yadavalli, Alternative hyper-heuristic strategies for multi-method global optimization, in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC2010), 2010, pp. 1–8. – start-page: 1 year: 2013 end-page: 33 ident: b0560 article-title: Contrasting meta-learning and hyper-heuristic research: the role of evolutionary algorithms publication-title: Genet. Program. Evolvable Mach. – year: 2013 ident: b0335 article-title: Analyzing Evolutionary Algorithms – reference: X. Li, K. Tang, M. Omidvar, Z. Yang, K. Qin, H. China, Benchmark functions for the CEC’2013 special session and competition on large-scale global optimization, Tech. rep., RMIT University, 2013. – year: 2005 ident: b0290 publication-title: SLS Methods – volume: 15 start-page: 122 year: 2002 end-page: 141 ident: b0200 article-title: Efficiency of local search with multiple local optima publication-title: SIAM J. Discrete Math. – volume: 36 start-page: 267 year: 2009 end-page: 306 ident: b0320 article-title: ParamILS: an automatic algorithm configuration framework publication-title: J. Artif. Intell. Res. – start-page: 829 year: 2011 end-page: 836 ident: b0455 article-title: Exploratory landscape analysis publication-title: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation – volume: vol. 445 start-page: 75 year: 2012 end-page: 89 ident: b0500 article-title: The algorithm selection problem on the continuous optimization domain publication-title: Computational Intelligence in Intelligent Data Analysis – reference: S. Rochet, G. Venturini, M. Slimane, E. El Kharoubi, A critical and empirical study of epistasis measures for predicting ga performances: a summary, in: Third European Conference on Artificial Evolution, 1998, pp. 275–285. – volume: 45 start-page: 12 year: 2014 end-page: 24 ident: b0690 article-title: Towards objective measures of algorithm performance across instance space publication-title: Comput. Oper. Res. – volume: 143 start-page: 189 year: 2003 end-page: 217 ident: b0790 article-title: Problem difficulty for tabu search in job-shop scheduling publication-title: Artif. Intell. – volume: 63 start-page: 325 year: 1990 end-page: 336 ident: b0800 article-title: Correlated and uncorrelated fitness landscapes and how to tell the difference publication-title: Biol. Cybern. – volume: 10 start-page: 1 year: 2002 end-page: 34 ident: b0675 article-title: Fitness landscapes and evolvability publication-title: Evol. Comput. – volume: vol. 3011 start-page: 50 year: 2004 end-page: 64 ident: b0045 article-title: Simple rules for low-knowledge algorithm selection publication-title: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems – volume: 7 start-page: 69 year: 1999 end-page: 101 ident: b0270 article-title: Predicting epistasis from mathematical models publication-title: Evol. Comput. – start-page: 847 year: 2013 end-page: 855 ident: b0740 article-title: Auto-WEKA: combined selection and hyperparameter optimization of classification algorithms publication-title: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining – reference: J. Rice, Methodology for the algorithm selection problem, in: Proceedings of the IFIP TC 2.5 Working Conference on Performance Evaluation of Numerical Software, 1979, pp. 301–307. – volume: 4 start-page: 1 year: 2000 end-page: 15 ident: b0520 article-title: A comparison of predictive measures of problem difficulty in evolutionary algorithms publication-title: IEEE Trans. Evol. Comput. – volume: 55 start-page: 687 year: 2004 end-page: 693 ident: b0615 article-title: Statistical analysis of local search landscapes publication-title: J. Oper. Res. Soc. – volume: 13 start-page: 281 year: 2012 end-page: 305 ident: b0055 article-title: Random search for hyper-parameter optimization publication-title: J. Mach. Learn. Res. – reference: L. Xu, F. Hutter, H. Hoos, K. Leyton-Brown, Hydra-MIP: automated algorithm configuration and selection for mixed integer programming, in: Proceedings of the 18th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2011. – reference: R. Morgan, M. Gallagher, Length scale for characterising continuous optimization problems, in: Proceedings of Parallel Problem Solving from Nature (PPSN XII), Lect. Notes Comput. Sci., 2012, pp. 407–416. – reference: T. Jansen, On classifications of fitness functions, Tech. Rep. CI-76/99, University of Dortmund, November 1999. – volume: 15 start-page: 2085 year: 2011 end-page: 2087 ident: b0405 article-title: Editorial scalability of evolutionary algorithms and other metaheuristics for large-scale continuous optimization problems publication-title: Soft Comput. – start-page: 313 year: 2012 end-page: 320 ident: b0070 article-title: Algorithm selection based on exploratory landscape analysis and cost-sensitive learning publication-title: Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation Conference – start-page: 184 year: 1995 end-page: 192 ident: b0340 article-title: Fitness distance correlation as a measure of problem difficulty for genetic algorithms publication-title: Proceedings of the Sixth International Conference on Genetic Algorithms – volume: vol. 15 start-page: 65 year: 1976 end-page: 118 ident: b0625 article-title: The algorithm selection problem publication-title: Advances in Computers – volume: vol. 3103 start-page: 690 year: 2004 end-page: 701 ident: b0755 article-title: Fitness clouds and problem hardness in genetic programming publication-title: Genetic and Evolutionary Computation – GECCO 2004 – volume: 20 start-page: 013119 year: 2010 ident: b0855 article-title: Modeling the basin of attraction as a two-dimensional manifold from experimental data: applications to balance in humans publication-title: Chaos – start-page: 142 year: 2009 end-page: 157 ident: b0020 article-title: A gender-based genetic algorithm for the automatic configuration of algorithms publication-title: Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming – volume: vol. 6695 start-page: 369 year: 2011 end-page: 370 ident: b0440 article-title: Non-model-based algorithm portfolios for SAT publication-title: Theory and Applications of Satisfiability Testing – SAT 2011 – volume: 53 start-page: 630 year: 2002 end-page: 636 ident: b0015 article-title: Markov chain modelling of the solution surface in local search publication-title: J. Oper. Res. Soc. – volume: vol. 5361 start-page: 319 year: 2008 end-page: 328 ident: b0720 article-title: Information theoretic classification of problems for metaheuristics publication-title: Proceedings of Simulated Evolution and Learning 20 08 – year: 2013 ident: b0095 article-title: Evolutionary algorithm characterization in real parameter optimization problems publication-title: Appl. Soft Comput. – volume: 3 start-page: 124 year: 1999 end-page: 141 ident: b0165 article-title: Parameter control in evolutionary algorithms publication-title: IEEE Trans. Evol. Comput. – volume: 8 start-page: 31 year: 2000 end-page: 60 ident: b0765 article-title: Information characteristics and the structure of landscapes publication-title: Evol. Comput. – volume: vol. 2611 year: 2003 ident: b0180 article-title: On confidence intervals for the number of local optima publication-title: Applications of Evolutionary Computing – start-page: 587 year: 2005 end-page: 610 ident: b0610 article-title: Fitness landscapes publication-title: Search Methodologies – volume: 56 start-page: 22:1 year: 2009 end-page: 22:52 ident: b0375 article-title: Empirical hardness models: methodology and a case study on combinatorial auctions publication-title: J. ACM – reference: M. Pedersen, Tuning & simplifying heuristical optimization, Ph.D. thesis, University of Southampton, 2009. – volume: vol. 6238 start-page: 73 year: 2010 end-page: 82 ident: b0460 article-title: Benchmarking evolutionary algorithms: towards exploratory landscape analysis publication-title: Proceedings of Parallel Problem Solving from Nature (PPSN XI) – volume: 15 start-page: 435 year: 2007 end-page: 443 ident: b0265 article-title: A note on problem difficulty measures in black-box optimization: classification, realizations and predictability publication-title: Evol. Comput. – volume: 14 start-page: 782 year: 2010 end-page: 800 ident: b0575 article-title: Population-based algorithm portfolios for numerical optimization publication-title: IEEE Trans. Evol. Comput. – volume: 47 start-page: 65 year: 2013 end-page: 76 ident: b0385 article-title: Knowledge-based instance selection: a compromise between efficiency and versatility publication-title: Knowl.-Based Syst. – volume: 13 start-page: 243 year: 2009 end-page: 259 ident: b0780 article-title: Self-adaptive multimethod search for global optimization in real-parameter spaces publication-title: IEEE Trans. Evol. Comput. – volume: 13 start-page: 213 year: 2005 end-page: 239 ident: b0745 article-title: A study of fitness distance correlation as a difficulty measure in genetic programming publication-title: Evol. Comput. – start-page: 751 year: 2010 end-page: 756 ident: b0345 article-title: Isac – instance-specific algorithm configuration publication-title: Proceedings of the 2010 Conference on ECAI 2010: 19th European Conference on Artificial Intelligence – volume: vol. 7317 start-page: 228 year: 2012 end-page: 241 ident: b0845 article-title: Evaluating component solver contributions to portfolio-based algorithm selectors publication-title: Theory and Applications of Satisfiability Testing – start-page: 65 year: 1997 end-page: 72 ident: b0525 article-title: Epistasis as a basic concept in formal landscape analysis publication-title: Proceedings of the 7th International Conference on Genetic Algorithms – volume: 31 start-page: 61 year: 2009 end-page: 85 ident: b0355 article-title: A survey: algorithms simulating bee swarm intelligence publication-title: Artif. Intell. Rev. – volume: 19 start-page: 74 year: 2015 end-page: 87 ident: b0515 article-title: Exploratory landscape analysis of continuous space optimization problems using information content publication-title: IEEE Trans. Evol. Comput. – volume: 61 start-page: 87 year: 2011 end-page: 104 ident: b0700 article-title: Discovering the suitability of optimisation algorithms by learning from evolved instances publication-title: Ann. Math. Artif. Intel. – start-page: 135 year: 2006 end-page: 163 ident: b0545 article-title: Quasi-newton methods publication-title: Numerical Optimization – volume: vol. 1141 start-page: 208 year: 1996 end-page: 217 ident: b0650 article-title: The density of states – a measure of the difficulty of optimisation problems publication-title: Parallel Problem Solving from Nature – PPSN IV – volume: 1 start-page: 67 year: 1997 end-page: 82 ident: b0825 article-title: No free lunch theorems for optimization publication-title: IEEE Trans. Evol. Comput. – volume: 267 start-page: 191 year: 2014 end-page: 200 ident: b0580 article-title: How novel is the “novel” black hole optimization approach? publication-title: Inform. Sci. – reference: T. Bartz-Beielstein, C. Lasarczyk, M. Preuß, Sequential parameter optimization, in: The 2005 IEEE Congress on Evolutionary Computation, vol. 1, 2005, pp. 773–780. – volume: vol. 2636 year: 2003 ident: b0085 article-title: Using landscape theory to measure learning difficulty for adaptive agents publication-title: Adaptive Agents and Multi-Agent Systems – reference: L. Xu, F. Hutter, H. Hoos, K. Leyton-brown, Satzilla2009: an automatic algorithm portfolio for sat. solver description, in: 2009 SAT Competition, 2009. – reference: N. Hansen, A. Auger, R. Ros, S. Finck, P. Pošík, Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009, in: Genetic and Evolutionary Computation Conference, 2011, pp. 1689–1696. – volume: 11 start-page: 4135 year: 2011 end-page: 4151 ident: b0075 article-title: Hybrid metaheuristics in combinatorial optimization: a survey publication-title: Appl. Soft Comput. – year: 2011 ident: b0025 article-title: Theory of Randomized Search Heuristics – reference: >. – volume: 4 start-page: 65 year: 1994 end-page: 85 ident: b0820 article-title: A genetic algorithm tutorial publication-title: Stat. Comput. – volume: 19 start-page: 760 year: 1973 end-page: 766 ident: b0420 article-title: Optimization by direct search and systematic reduction of the size of search region publication-title: AIChE J. – volume: 41 start-page: 6:1 year: 2009 end-page: 6:25 ident: b0685 article-title: Cross-disciplinary perspectives on meta-learning for algorithm selection publication-title: ACM Comput. Surv. – year: 2005 ident: b0285 publication-title: Introduction – reference: M. Dorigo, V. Maniezzo, A. Colorni, Ant system: an autocatalytic optimizing process, Tech. Rep. 91-016, Politecnico di Milano, 1991. – volume: 32 start-page: 565 year: 2008 end-page: 606 ident: b0830 article-title: SATzilla: portfolio-based algorithm selection for SAT publication-title: J. Artif. Intell. Res. – volume: 1 start-page: 111 year: 2011 end-page: 128 ident: b0260 article-title: An introduction and survey of estimation of distribution algorithms publication-title: Swarm Evol. Comput. – volume: vol. 6187 start-page: 482 year: 2010 end-page: 500 ident: b0300 article-title: Can shared-neighbor distances defeat the curse of dimensionality? publication-title: Scientific and Statistical Database Management – volume: 12 start-page: 303 year: 2004 end-page: 325 ident: b0465 article-title: Advanced fitness landscape analysis and the performance of memetic algorithms publication-title: Evol. Comput. – volume: 15 start-page: 591 year: 2011 end-page: 607 ident: b0115 article-title: A multi-facet survey on memetic computation publication-title: IEEE Trans. Evol. Comput. – volume: 126 start-page: 43 year: 2001 end-page: 62 ident: b0205 article-title: Algorithm portfolios publication-title: Artif. Intell. – reference: E. Pitze, M. Affenzeller, A. Beham, S. Wagner, Comprehensive and automatic fitness landscape analysis using heuristiclab, in: EUROCAST 2011, Lect. Notes Comput. Sci., vol. 6927, 2012, pp. 424–431. – volume: 21 start-page: 417 year: 1979 end-page: 432 ident: b0655 article-title: A simple method for regression analysis with censored data publication-title: Technometrics – volume: vol. 5851 start-page: 89 year: 2009 ident: 10.1016/j.ins.2015.05.010_b0695 article-title: A knowledge discovery approach to understanding relationships between scheduling problem structure and heuristic performance – volume: 20 start-page: 1 year: 1996 ident: 10.1016/j.ins.2015.05.010_b0715 article-title: Landscapes and their correlation functions publication-title: J. Math. Chem. doi: 10.1007/BF01165154 – ident: 10.1016/j.ins.2015.05.010_b0390 – ident: 10.1016/j.ins.2015.05.010_b0510 doi: 10.1007/978-3-642-32937-1_23 – volume: vol. 3103 start-page: 690 year: 2004 ident: 10.1016/j.ins.2015.05.010_b0755 article-title: Fitness clouds and problem hardness in genetic programming – volume: 1 start-page: 111 year: 1963 ident: 10.1016/j.ins.2015.05.010_b0360 article-title: Random search techniques for optimization problems publication-title: Automatica doi: 10.1016/0005-1098(63)90018-9 – ident: 10.1016/j.ins.2015.05.010_b0630 – start-page: 184 year: 1995 ident: 10.1016/j.ins.2015.05.010_b0340 article-title: Fitness distance correlation as a measure of problem difficulty for genetic algorithms – start-page: 608 year: 2013 ident: 10.1016/j.ins.2015.05.010_b0445 article-title: Algorithm portfolios based on cost-sensitive hierarchical clustering – ident: 10.1016/j.ins.2015.05.010_b0295 – volume: vol. 6187 start-page: 482 year: 2010 ident: 10.1016/j.ins.2015.05.010_b0300 article-title: Can shared-neighbor distances defeat the curse of dimensionality? – ident: 10.1016/j.ins.2015.05.010_b0570 – volume: 22 start-page: 3 issue: 1 year: 2015 ident: 10.1016/j.ins.2015.05.010_b0865 article-title: Metaheuristics—the metaphor exposed publication-title: Int. T. Oper. Res. doi: 10.1111/itor.12001 – volume: 15 start-page: 435 issue: 4 year: 2007 ident: 10.1016/j.ins.2015.05.010_b0265 article-title: A note on problem difficulty measures in black-box optimization: classification, realizations and predictability publication-title: Evol. Comput. doi: 10.1162/evco.2007.15.4.435 – volume: 16 start-page: 683 issue: 4 year: 2012 ident: 10.1016/j.ins.2015.05.010_b0450 article-title: How landscape ruggedness influences the performance of real-coded algorithms: a comparative study publication-title: Soft Comput. doi: 10.1007/s00500-011-0781-5 – volume: 143 start-page: 189 issue: 2 year: 2003 ident: 10.1016/j.ins.2015.05.010_b0790 article-title: Problem difficulty for tabu search in job-shop scheduling publication-title: Artif. Intell. doi: 10.1016/S0004-3702(02)00363-6 – volume: 228 start-page: 1 issue: 1 year: 2013 ident: 10.1016/j.ins.2015.05.010_b0125 article-title: Optimisation of gravity-fed water distribution network design: a critical review publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.11.046 – volume: 47 start-page: 295 year: 2006 ident: 10.1016/j.ins.2015.05.010_b0195 article-title: Learning dynamic algorithm portfolios publication-title: Ann. Math. Artif. Intel. doi: 10.1007/s10472-006-9036-z – volume: vol. 6695 start-page: 369 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0440 article-title: Non-model-based algorithm portfolios for SAT – volume: 63 start-page: 325 year: 1990 ident: 10.1016/j.ins.2015.05.010_b0800 article-title: Correlated and uncorrelated fitness landscapes and how to tell the difference publication-title: Biol. Cybern. doi: 10.1007/BF00202749 – volume: 24 start-page: 67 issue: 1–2 year: 2000 ident: 10.1016/j.ins.2015.05.010_b0210 article-title: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems publication-title: J. Autom. Reason. doi: 10.1023/A:1006314320276 – volume: vol. 445 start-page: 75 year: 2012 ident: 10.1016/j.ins.2015.05.010_b0500 article-title: The algorithm selection problem on the continuous optimization domain – volume: 11 start-page: 285 year: 2010 ident: 10.1016/j.ins.2015.05.010_b0595 article-title: Theoretical results in genetic programming: the next ten years? publication-title: Genet. Program. Evolvable Mach. doi: 10.1007/s10710-010-9110-5 – year: 2005 ident: 10.1016/j.ins.2015.05.010_b0290 – volume: 266 start-page: 16 issue: 0 year: 2014 ident: 10.1016/j.ins.2015.05.010_b0380 article-title: On the use of meta-learning for instance selection: an architecture and an experimental study publication-title: Inform. Sci. doi: 10.1016/j.ins.2014.01.007 – volume: 1 start-page: 50 issue: 2 year: 2010 ident: 10.1016/j.ins.2015.05.010_b0815 article-title: A rigorous analysis of the harmony search algorithm: how the research community can be misled by a “novel” methodology publication-title: Int. J. Appl. Metaheur. Comput. doi: 10.4018/jamc.2010040104 – start-page: 108 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0410 article-title: Fitness–probability cloud and a measure of problem hardness for evolutionary algorithms – ident: 10.1016/j.ins.2015.05.010_b0605 doi: 10.1109/ICEC.1997.592287 – volume: 206 start-page: 79 issue: 0 year: 2014 ident: 10.1016/j.ins.2015.05.010_b0325 article-title: Algorithm runtime prediction: methods & evaluation publication-title: Artif. Intell. doi: 10.1016/j.artint.2013.10.003 – ident: 10.1016/j.ins.2015.05.010_b0750 doi: 10.1109/ICSCCW.2009.5379477 – volume: 8 start-page: 31 issue: 1 year: 2000 ident: 10.1016/j.ins.2015.05.010_b0765 article-title: Information characteristics and the structure of landscapes publication-title: Evol. Comput. doi: 10.1162/106365600568095 – start-page: 311 year: 2010 ident: 10.1016/j.ins.2015.05.010_b0065 article-title: F-Race and iterated F-Race: an overview – volume: 14 start-page: 782 issue: 5 year: 2010 ident: 10.1016/j.ins.2015.05.010_b0575 article-title: Population-based algorithm portfolios for numerical optimization publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2010.2040183 – start-page: 847 year: 2013 ident: 10.1016/j.ins.2015.05.010_b0740 article-title: Auto-WEKA: combined selection and hyperparameter optimization of classification algorithms – volume: vol. 2 start-page: 1101 year: 2001 ident: 10.1016/j.ins.2015.05.010_b0400 article-title: Scaling up fast evolutionary programming with cooperative coevolution – start-page: 7 year: 1995 ident: 10.1016/j.ins.2015.05.010_b0620 article-title: An experimental design perspective on genetic algorithms doi: 10.1016/B978-1-55860-356-1.50005-4 – ident: 10.1016/j.ins.2015.05.010_b0080 doi: 10.1007/978-3-540-30217-9_2 – year: 2011 ident: 10.1016/j.ins.2015.05.010_b0025 – ident: 10.1016/j.ins.2015.05.010_b0155 doi: 10.1109/MHS.1995.494215 – start-page: 10 year: 2006 ident: 10.1016/j.ins.2015.05.010_b0540 article-title: Fundamentals of unconstrained optimization – start-page: 66 year: 2006 ident: 10.1016/j.ins.2015.05.010_b0550 article-title: Trust-region methods – volume: 7 start-page: 69 issue: 1 year: 1999 ident: 10.1016/j.ins.2015.05.010_b0270 article-title: Predicting epistasis from mathematical models publication-title: Evol. Comput. doi: 10.1162/evco.1999.7.1.69 – volume: 3 start-page: 124 issue: 2 year: 1999 ident: 10.1016/j.ins.2015.05.010_b0165 article-title: Parameter control in evolutionary algorithms publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/4235.771166 – volume: 55 start-page: 687 issue: 7 year: 2004 ident: 10.1016/j.ins.2015.05.010_b0615 article-title: Statistical analysis of local search landscapes publication-title: J. Oper. Res. Soc. doi: 10.1057/palgrave.jors.2601611 – volume: 1 start-page: 67 issue: 1 year: 1997 ident: 10.1016/j.ins.2015.05.010_b0825 article-title: No free lunch theorems for optimization publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/4235.585893 – volume: vol. 6443 start-page: 567 year: 2010 ident: 10.1016/j.ins.2015.05.010_b0100 article-title: Real-valued multimodal fitness landscape characterization for evolution – volume: 163 start-page: 255 issue: 2 year: 1993 ident: 10.1016/j.ins.2015.05.010_b0805 article-title: Why some fitness landscapes are fractal publication-title: J. Theor. Biol. doi: 10.1006/jtbi.1993.1120 – volume: 122 start-page: 375 issue: 0 year: 2013 ident: 10.1016/j.ins.2015.05.010_b0220 article-title: Models of performance of time series forecasters publication-title: Neurocomputing doi: 10.1016/j.neucom.2013.05.035 – start-page: 1 year: 2006 ident: 10.1016/j.ins.2015.05.010_b0770 article-title: Confronting hardness using a hybrid approach – volume: 4 start-page: 65 issue: 2 year: 1994 ident: 10.1016/j.ins.2015.05.010_b0820 article-title: A genetic algorithm tutorial publication-title: Stat. Comput. doi: 10.1007/BF00175354 – volume: 22 start-page: 52 issue: 3 year: 2002 ident: 10.1016/j.ins.2015.05.010_b0565 article-title: Biomimicry of bacterial foraging for distributed optimization and control publication-title: IEEE Control Syst. Mag. doi: 10.1109/MCS.2002.1004010 – volume: vol. 4204 start-page: 213 year: 2006 ident: 10.1016/j.ins.2015.05.010_b0310 article-title: Performance prediction and automated tuning of randomized and parametric algorithms – volume: 56 start-page: 22:1 year: 2009 ident: 10.1016/j.ins.2015.05.010_b0375 article-title: Empirical hardness models: methodology and a case study on combinatorial auctions publication-title: J. ACM doi: 10.1145/1538902.1538906 – volume: 47 start-page: 1 year: 2013 ident: 10.1016/j.ins.2015.05.010_b0785 article-title: A feature subset selection algorithm automatic recommendation method publication-title: J. Artif. Intell. Res. doi: 10.1613/jair.3831 – volume: vol. 6683 start-page: 507 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0315 article-title: Sequential model-based optimization for general algorithm configuration – volume: vol. 5254 start-page: 38 year: 2008 ident: 10.1016/j.ins.2015.05.010_b0130 article-title: Sample selection bias correction theory – volume: 36 start-page: 267 year: 2009 ident: 10.1016/j.ins.2015.05.010_b0320 article-title: ParamILS: an automatic algorithm configuration framework publication-title: J. Artif. Intell. Res. doi: 10.1613/jair.2861 – ident: 10.1016/j.ins.2015.05.010_b0490 doi: 10.1007/978-3-642-32937-1_41 – volume: vol. 11 start-page: 129 year: 2004 ident: 10.1016/j.ins.2015.05.010_b0725 article-title: EC theory – “in theory” – volume: 212 start-page: 79 issue: 0 year: 2012 ident: 10.1016/j.ins.2015.05.010_b0775 article-title: A note on teaching-learning-based optimization algorithm publication-title: Inform. Sci. doi: 10.1016/j.ins.2012.05.009 – start-page: 313 year: 2012 ident: 10.1016/j.ins.2015.05.010_b0070 article-title: Algorithm selection based on exploratory landscape analysis and cost-sensitive learning – volume: PP issue: 99 year: 2013 ident: 10.1016/j.ins.2015.05.010_b0495 article-title: Sampling techniques and distance metrics in high dimensional continuous landscape analysis: limitations and improvements publication-title: IEEE Trans. Evol. Comput. – ident: 10.1016/j.ins.2015.05.010_b0485 – volume: 21 start-page: 417 issue: 4 year: 1979 ident: 10.1016/j.ins.2015.05.010_b0655 article-title: A simple method for regression analysis with censored data publication-title: Technometrics doi: 10.1080/00401706.1979.10489811 – year: 2013 ident: 10.1016/j.ins.2015.05.010_b0105 – volume: 1 start-page: 81 issue: 2 year: 1997 ident: 10.1016/j.ins.2015.05.010_b0670 article-title: Operator and parameter adaptation in genetic algorithms publication-title: Soft Comput. doi: 10.1007/s005000050009 – volume: vol. 5361 start-page: 319 year: 2008 ident: 10.1016/j.ins.2015.05.010_b0720 article-title: Information theoretic classification of problems for metaheuristics – volume: 5 start-page: 129 issue: 2 year: 2001 ident: 10.1016/j.ins.2015.05.010_b0190 article-title: Design of evolutionary algorithms – a statistical perspective publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/4235.918434 – volume: 13 start-page: 281 issue: 1 year: 2012 ident: 10.1016/j.ins.2015.05.010_b0055 article-title: Random search for hyper-parameter optimization publication-title: J. Mach. Learn. Res. – volume: vol. 3011 start-page: 50 year: 2004 ident: 10.1016/j.ins.2015.05.010_b0045 article-title: Simple rules for low-knowledge algorithm selection – volume: vol. 1809 start-page: 62 year: 2000 ident: 10.1016/j.ins.2015.05.010_b0305 article-title: Exploiting competitive planner performance – volume: vol. 15 start-page: 65 year: 1976 ident: 10.1016/j.ins.2015.05.010_b0625 article-title: The algorithm selection problem – volume: 10 start-page: 1 issue: 1 year: 2002 ident: 10.1016/j.ins.2015.05.010_b0675 article-title: Fitness landscapes and evolvability publication-title: Evol. Comput. doi: 10.1162/106365602317301754 – volume: vol. 6238 start-page: 73 year: 2010 ident: 10.1016/j.ins.2015.05.010_b0460 article-title: Benchmarking evolutionary algorithms: towards exploratory landscape analysis – volume: 11 start-page: 4135 issue: 6 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0075 article-title: Hybrid metaheuristics in combinatorial optimization: a survey publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.02.032 – volume: 279 start-page: 94 year: 2014 ident: 10.1016/j.ins.2015.05.010_b0735 article-title: Population-based algorithm portfolios with automated constituent algorithms selection publication-title: Inform. Sci. doi: 10.1016/j.ins.2014.03.105 – volume: 126 start-page: 43 issue: 1–2 year: 2001 ident: 10.1016/j.ins.2015.05.010_b0205 article-title: Algorithm portfolios publication-title: Artif. Intell. doi: 10.1016/S0004-3702(00)00081-3 – volume: vol. 434 start-page: 417 year: 2013 ident: 10.1016/j.ins.2015.05.010_b0705 article-title: Predicting metaheuristic performance on graph coloring problems using data mining – ident: 10.1016/j.ins.2015.05.010_b0245 doi: 10.1145/1830761.1830790 – volume: 4 start-page: 1 issue: 1 year: 2000 ident: 10.1016/j.ins.2015.05.010_b0520 article-title: A comparison of predictive measures of problem difficulty in evolutionary algorithms publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/4235.843491 – volume: 6 start-page: 119 year: 2006 ident: 10.1016/j.ins.2015.05.010_b0010 article-title: On learning algorithm selection for classification publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2004.12.002 – volume: 21 start-page: 533 issue: 4 year: 2013 ident: 10.1016/j.ins.2015.05.010_b0230 article-title: Models of performance of evolutionary program induction algorithms based on indicators of problem difficulty publication-title: Evol. Comput. doi: 10.1162/EVCO_a_00096 – volume: 13 start-page: 243 issue: 2 year: 2009 ident: 10.1016/j.ins.2015.05.010_b0780 article-title: Self-adaptive multimethod search for global optimization in real-parameter spaces publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2008.924428 – volume: 19 start-page: 760 issue: 4 year: 1973 ident: 10.1016/j.ins.2015.05.010_b0420 article-title: Optimization by direct search and systematic reduction of the size of search region publication-title: AIChE J. doi: 10.1002/aic.690190413 – volume: 267 start-page: 191 year: 2014 ident: 10.1016/j.ins.2015.05.010_b0580 article-title: How novel is the “novel” black hole optimization approach? publication-title: Inform. Sci. doi: 10.1016/j.ins.2014.01.026 – year: 2013 ident: 10.1016/j.ins.2015.05.010_b0335 – volume: 8 start-page: 117 issue: 3 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0350 article-title: Selection of algorithms to solve traveling salesman problems using meta-learning publication-title: Int. J. Hybrid Intell. Syst. doi: 10.3233/HIS-2011-0133 – volume: 241 start-page: 148 issue: 0 year: 2013 ident: 10.1016/j.ins.2015.05.010_b0430 article-title: A survey of techniques for characterising fitness landscapes and some possible ways forward publication-title: Inform. Sci. doi: 10.1016/j.ins.2013.04.015 – volume: 61 start-page: 87 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0700 article-title: Discovering the suitability of optimisation algorithms by learning from evolved instances publication-title: Ann. Math. Artif. Intel. doi: 10.1007/s10472-011-9230-5 – ident: 10.1016/j.ins.2015.05.010_b0235 doi: 10.1109/CEC.2010.5585980 – start-page: 135 year: 2006 ident: 10.1016/j.ins.2015.05.010_b0545 article-title: Quasi-newton methods – volume: 45 start-page: 12 issue: 0 year: 2014 ident: 10.1016/j.ins.2015.05.010_b0690 article-title: Towards objective measures of algorithm performance across instance space publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2013.11.015 – volume: 181 start-page: 1224 issue: 7 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0665 article-title: Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms publication-title: Inform. Sci. doi: 10.1016/j.ins.2010.12.006 – volume: vol. 193 start-page: 1 year: 2009 ident: 10.1016/j.ins.2015.05.010_b0810 article-title: Why is optimization difficult? – volume: 15 start-page: 169 issue: 2 year: 2007 ident: 10.1016/j.ins.2015.05.010_b0660 article-title: An information-theoretic analysis on the interactions of variables in combinatorial optimization problems publication-title: Evol. Comput. doi: 10.1162/evco.2007.15.2.169 – ident: 10.1016/j.ins.2015.05.010_b0795 – volume: 15 start-page: 4 issue: 1 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0135 article-title: Differential evolution: a survey of the state-of-the-art publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2010.2059031 – ident: 10.1016/j.ins.2015.05.010_b0040 doi: 10.1109/CEC.2005.1554761 – ident: 10.1016/j.ins.2015.05.010_b0050 – volume: 174 start-page: 1254 year: 2010 ident: 10.1016/j.ins.2015.05.010_b0225 article-title: Practical performance models of algorithms in evolutionary program induction and other domains publication-title: Artif. Intell. doi: 10.1016/j.artint.2010.07.005 – year: 2000 ident: 10.1016/j.ins.2015.05.010_b0120 – start-page: 21 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0555 article-title: Runtime analysis of evolutionary algorithms for discrete optimization – volume: 15 start-page: 591 issue: 5 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0115 article-title: A multi-facet survey on memetic computation publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2011.2132725 – year: 2010 ident: 10.1016/j.ins.2015.05.010_b0530 – ident: 10.1016/j.ins.2015.05.010_b0425 doi: 10.1109/CEC.2009.4983112 – volume: 13 start-page: 213 issue: 2 year: 2005 ident: 10.1016/j.ins.2015.05.010_b0745 article-title: A study of fitness distance correlation as a difficulty measure in genetic programming publication-title: Evol. Comput. doi: 10.1162/1063656054088549 – volume: 57 start-page: 121 issue: 1 year: 2010 ident: 10.1016/j.ins.2015.05.010_b0030 article-title: Continuous lunches are free plus the design of optimal optimization algorithms publication-title: Algorithmica doi: 10.1007/s00453-008-9244-5 – year: 2006 ident: 10.1016/j.ins.2015.05.010_b0035 – volume: vol. 7317 start-page: 228 year: 2012 ident: 10.1016/j.ins.2015.05.010_b0845 article-title: Evaluating component solver contributions to portfolio-based algorithm selectors – volume: 15 start-page: 122 issue: 1 year: 2002 ident: 10.1016/j.ins.2015.05.010_b0200 article-title: Efficiency of local search with multiple local optima publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480199355225 – volume: 1 start-page: 111 issue: 3 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0260 article-title: An introduction and survey of estimation of distribution algorithms publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2011.08.003 – start-page: 1 year: 2013 ident: 10.1016/j.ins.2015.05.010_b0560 article-title: Contrasting meta-learning and hyper-heuristic research: the role of evolutionary algorithms publication-title: Genet. Program. Evolvable Mach. – volume: 12 start-page: 303 issue: 3 year: 2004 ident: 10.1016/j.ins.2015.05.010_b0465 article-title: Advanced fitness landscape analysis and the performance of memetic algorithms publication-title: Evol. Comput. doi: 10.1162/1063656041774956 – volume: 15 start-page: 2085 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0405 article-title: Editorial scalability of evolutionary algorithms and other metaheuristics for large-scale continuous optimization problems publication-title: Soft Comput. doi: 10.1007/s00500-010-0639-2 – ident: 10.1016/j.ins.2015.05.010_b0505 doi: 10.1109/CEC.2012.6256490 – volume: 64 start-page: 1695 issue: 12 year: 2013 ident: 10.1016/j.ins.2015.05.010_b0090 article-title: Hyper-heuristics: a survey of the state of the art publication-title: J. Oper. Res. Soc. doi: 10.1057/jors.2013.71 – ident: 10.1016/j.ins.2015.05.010_b0150 – issue: 0 year: 2013 ident: 10.1016/j.ins.2015.05.010_b0095 article-title: Evolutionary algorithm characterization in real parameter optimization problems publication-title: Appl. Soft Comput. – ident: 10.1016/j.ins.2015.05.010_b0280 – volume: 47 start-page: 65 issue: 0 year: 2013 ident: 10.1016/j.ins.2015.05.010_b0385 article-title: Knowledge-based instance selection: a compromise between efficiency and versatility publication-title: Knowl.-Based Syst. doi: 10.1016/j.knosys.2013.04.005 – ident: 10.1016/j.ins.2015.05.010_b0185 doi: 10.1007/BFb0056848 – start-page: 751 year: 2010 ident: 10.1016/j.ins.2015.05.010_b0345 article-title: Isac – instance-specific algorithm configuration – volume: vol. 378 start-page: 161 year: 2012 ident: 10.1016/j.ins.2015.05.010_b0590 article-title: A comprehensive survey on fitness landscape analysis – volume: 20 start-page: 013119 issue: 1 year: 2010 ident: 10.1016/j.ins.2015.05.010_b0855 article-title: Modeling the basin of attraction as a two-dimensional manifold from experimental data: applications to balance in humans publication-title: Chaos doi: 10.1063/1.3337690 – ident: 10.1016/j.ins.2015.05.010_b0330 – volume: vol. 57 start-page: 287 year: 2003 ident: 10.1016/j.ins.2015.05.010_b0275 article-title: The theory and practice of simulated annealing – volume: 53 start-page: 630 issue: 6 year: 2002 ident: 10.1016/j.ins.2015.05.010_b0015 article-title: Markov chain modelling of the solution surface in local search publication-title: J. Oper. Res. Soc. doi: 10.1057/palgrave/jors/2601342 – volume: vol. 54 start-page: 1 year: 2005 ident: 10.1016/j.ins.2015.05.010_b0145 article-title: Parameter setting in EAs: a 30 year perspective – volume: 35 issue: 3 year: 2014 ident: 10.1016/j.ins.2015.05.010_b0860 article-title: Algorithm selection for combinatorial search problems: a survey publication-title: AI Magazine doi: 10.1609/aimag.v35i3.2460 – volume: 11 start-page: 5755 issue: 8 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0250 article-title: Impacts of invariance in search: when CMA-ES and PSO face ill-conditioned and non-separable problems publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.03.001 – volume: vol. 7298 start-page: 244 year: 2012 ident: 10.1016/j.ins.2015.05.010_b0435 article-title: Instance-specific algorithm configuration as a method for non-model-based portfolio generation – start-page: 65 year: 1997 ident: 10.1016/j.ins.2015.05.010_b0525 article-title: Epistasis as a basic concept in formal landscape analysis – year: 2005 ident: 10.1016/j.ins.2015.05.010_b0285 – volume: 19 start-page: 74 issue: 1 year: 2015 ident: 10.1016/j.ins.2015.05.010_b0515 article-title: Exploratory landscape analysis of continuous space optimization problems using information content publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2014.2302006 – volume: 8 start-page: 191 issue: 1 year: 2008 ident: 10.1016/j.ins.2015.05.010_b0255 article-title: Application areas of ais: the past, the present and the future publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2006.12.004 – start-page: 829 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0455 article-title: Exploratory landscape analysis – ident: 10.1016/j.ins.2015.05.010_b0640 doi: 10.1007/BFb0026607 – volume: 1 start-page: 19 issue: 1 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0175 article-title: Parameter tuning for configuring and analyzing evolutionary algorithms publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2011.02.001 – volume: 1 start-page: 3 issue: 1 year: 2002 ident: 10.1016/j.ins.2015.05.010_b0060 article-title: Evolution strategies: a comprehensive introduction publication-title: Nat. Comput. doi: 10.1023/A:1015059928466 – start-page: 837 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0600 article-title: Niching foundations: basin identification on fixed-property generated landscapes – start-page: 101 year: 2006 ident: 10.1016/j.ins.2015.05.010_b0535 article-title: Conjugate gradient methods – volume: vol. 2610 start-page: 455 year: 2003 ident: 10.1016/j.ins.2015.05.010_b0760 article-title: Fitness distance correlation in structural mutation genetic programming – start-page: 477 year: 2006 ident: 10.1016/j.ins.2015.05.010_b0415 article-title: The dispersion metric and the CMA evolution strategy – year: 1993 ident: 10.1016/j.ins.2015.05.010_b0160 – start-page: 98 year: 2012 ident: 10.1016/j.ins.2015.05.010_b0470 article-title: evolutionary computation? on a growing gap between theory and practice – ident: 10.1016/j.ins.2015.05.010_b0835 – start-page: 587 year: 2005 ident: 10.1016/j.ins.2015.05.010_b0610 article-title: Fitness landscapes – start-page: 114 year: 2004 ident: 10.1016/j.ins.2015.05.010_b0850 article-title: Learning and evaluating classifiers under sample selection bias – volume: vol. 54 start-page: 19 year: 2005 ident: 10.1016/j.ins.2015.05.010_b0170 article-title: Parameter control in evolutionary algorithms – volume: vol. 1141 start-page: 208 year: 1996 ident: 10.1016/j.ins.2015.05.010_b0650 article-title: The density of states – a measure of the difficulty of optimisation problems – ident: 10.1016/j.ins.2015.05.010_b0680 doi: 10.1109/IJCNN.2008.4634391 – ident: 10.1016/j.ins.2015.05.010_b0840 – year: 2013 ident: 10.1016/j.ins.2015.05.010_b0110 – ident: 10.1016/j.ins.2015.05.010_b0215 – volume: 32 start-page: 565 issue: 1 year: 2008 ident: 10.1016/j.ins.2015.05.010_b0830 article-title: SATzilla: portfolio-based algorithm selection for SAT publication-title: J. Artif. Intell. Res. doi: 10.1613/jair.2490 – volume: vol. 2611 year: 2003 ident: 10.1016/j.ins.2015.05.010_b0180 article-title: On confidence intervals for the number of local optima – volume: vol. 2636 year: 2003 ident: 10.1016/j.ins.2015.05.010_b0085 article-title: Using landscape theory to measure learning difficulty for adaptive agents – ident: 10.1016/j.ins.2015.05.010_b0395 – volume: 41 start-page: 6:1 issue: 1 year: 2009 ident: 10.1016/j.ins.2015.05.010_b0685 article-title: Cross-disciplinary perspectives on meta-learning for algorithm selection publication-title: ACM Comput. Surv. doi: 10.1145/1456650.1456656 – ident: 10.1016/j.ins.2015.05.010_b0645 – start-page: 23 year: 1991 ident: 10.1016/j.ins.2015.05.010_b0140 article-title: Epistasis variance: a viewpoint on ga-hardness doi: 10.1016/B978-0-08-050684-5.50005-7 – volume: 13 start-page: 1120 issue: 5 year: 2009 ident: 10.1016/j.ins.2015.05.010_b0480 article-title: Frankenstein’s PSO: a composite particle swarm optimization algorithm publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2009.2021465 – ident: 10.1016/j.ins.2015.05.010_b0240 – ident: 10.1016/j.ins.2015.05.010_b0635 doi: 10.1109/ANZIIS.1996.573954 – volume: vol. 2470 start-page: 91 year: 2002 ident: 10.1016/j.ins.2015.05.010_b0370 article-title: Learning the empirical hardness of optimization problems: the case of combinatorial auctions – ident: 10.1016/j.ins.2015.05.010_b0005 doi: 10.1007/978-3-642-44973-4_4 – volume: vol. 6624 start-page: 294 year: 2011 ident: 10.1016/j.ins.2015.05.010_b0475 article-title: Global characterization of the CEC 2005 fitness landscapes using fitness–distance analysis – volume: 31 start-page: 61 issue: 1–4 year: 2009 ident: 10.1016/j.ins.2015.05.010_b0355 article-title: A survey: algorithms simulating bee swarm intelligence publication-title: Artif. Intell. Rev. doi: 10.1007/s10462-009-9127-4 – start-page: 142 year: 2009 ident: 10.1016/j.ins.2015.05.010_b0020 article-title: A gender-based genetic algorithm for the automatic configuration of algorithms – ident: 10.1016/j.ins.2015.05.010_b0730 – ident: 10.1016/j.ins.2015.05.010_b0585 |
| SSID | ssj0004766 |
| Score | 2.5739956 |
| Snippet | Selecting the most appropriate algorithm to use when attempting to solve a black-box continuous optimization problem is a challenging task. Such problems... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 224 |
| SubjectTerms | Algebra Algorithm selection Algorithms Black-box continuous optimization Derivatives Effectiveness Empirical performance models Exploratory landscape analysis Landscapes Optimization Performance prediction Problem hardness measures Skills Statistics |
| Title | Algorithm selection for black-box continuous optimization problems: A survey on methods and challenges |
| URI | https://dx.doi.org/10.1016/j.ins.2015.05.010 https://www.proquest.com/docview/1770333643 |
| Volume | 317 |
| WOSCitedRecordID | wos000358093400014&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6291 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004766 issn: 0020-0255 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3ti9MwGA9z5wf9IHoqnnoSQfzg6JG0a9r4rcqJL3AInjA_lTRNzh1be6zbGP4x_q0-aZK2nnioIIwyQtuN_n59XvK8IfSMTqUKSxYFsWQFOChcBynVMlAsBbTTUHNth00kJyfpbMY_jkbffS3MdpFUVbrb8Yv_CjWsAdimdPYv4O5uCgvwHUCHI8AOxz8CPluc1eDxf11OmnbGjc8lLMxWXVDUuzY9fV5tTPJrDRJj6UoxJ264TGOr1ZvNagsCA9btlGnbzFn64SvN0Kx1RU3tXZxObXooTTD-Fa2_udqgeT3JjvpgVCv2vmzEIB1g5TbShzn9rZRcnInlxg6D_yRM9OHD0XDbgsZdApzbS_P1ND-lexrjNTBejtVOViSnSRiw0M708jI7sgWfXuraMmynwEPbn_IX3WC3Kc7BoTFt2mlsO7aSXhF26Ykmgt06W2Atg4ZPyTW0FyYxT8doL3t3PHvfV94mNhru_7ePm7cZhJd-6HeWzyUboDVsTm-jW84jwZll0h00UtU-ujnoU7mPDl11C36OB0hjpxfuIt1xDnecw3Ae7jiHe87hIeew59xLnGHLOAyrjnEYGId7xt1Dn98cn75-G7gBHoEEO3cdRKXgXPCQFuBl60KXLBVgEBel1KKkhJWSyJIrziSV0zLWIQG5wcFoJTJOmWTRfTSu6ko9QLhUUiWhKiKhyLRgRJSFKLTUzMx3AJ_rABH_cHPputubISuL3KcxnueAR27wyAl8KDlAL7pLLmxrl6tOnnrEcvceWZszB3pdddlTj24OctsE40Sl4FnnNAFdG0XgEDz8t1s_Qjf69-oxGq9XG3WIrsvtet6snjii_gAKBsH1 |
| linkProvider | Elsevier |
| 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=Algorithm+selection+for+black-box+continuous+optimization+problems%3A+A+survey+on+methods+and+challenges&rft.jtitle=Information+sciences&rft.au=Mu%C3%B1oz%2C+Mario+A.&rft.au=Sun%2C+Yuan&rft.au=Kirley%2C+Michael&rft.au=Halgamuge%2C+Saman+K.&rft.date=2015-10-01&rft.pub=Elsevier+Inc&rft.issn=0020-0255&rft.eissn=1872-6291&rft.volume=317&rft.spage=224&rft.epage=245&rft_id=info:doi/10.1016%2Fj.ins.2015.05.010&rft.externalDocID=S0020025515003680 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0255&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0255&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0255&client=summon |