{"id":"https://openalex.org/W1970604725","doi":"https://doi.org/10.1109/cec.2010.5586064","title":"Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms","display_name":"Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms","publication_year":2010,"publication_date":"2010-07-01","ids":{"openalex":"https://openalex.org/W1970604725","doi":"https://doi.org/10.1109/cec.2010.5586064","mag":"1970604725"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2010.5586064","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2010.5586064","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004567468","display_name":"Edmund Burke","orcid":"https://orcid.org/0000-0003-0712-4762"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Edmund Burke","raw_affiliation_strings":["The Automated Scheduling, optimisAtion and Planning (ASAP) Research Group, University of Nottingham, UK","Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Automated Scheduling, optimisAtion and Planning (ASAP) Research Group, University of Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029547233","display_name":"Tim Curtois","orcid":"https://orcid.org/0000-0002-4743-416X"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tim Curtois","raw_affiliation_strings":["The Automated Scheduling, optimisAtion and Planning (ASAP) Research Group, University of Nottingham, UK","Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Automated Scheduling, optimisAtion and Planning (ASAP) Research Group, University of Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080865892","display_name":"Matthew Hyde","orcid":"https://orcid.org/0000-0001-8275-3919"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Matthew Hyde","raw_affiliation_strings":["The Automated Scheduling, optimisAtion and Planning (ASAP) Research Group, University of Nottingham, UK","Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Automated Scheduling, optimisAtion and Planning (ASAP) Research Group, University of Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074319022","display_name":"Graham Kendall","orcid":"https://orcid.org/0000-0003-2006-5103"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Graham Kendall","raw_affiliation_strings":["The Automated Scheduling, optimisAtion and Planning (ASAP) Research Group, University of Nottingham, UK","Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Automated Scheduling, optimisAtion and Planning (ASAP) Research Group, University of Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090624529","display_name":"Gabriela Ochoa","orcid":"https://orcid.org/0000-0001-7649-5669"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Gabriela Ochoa","raw_affiliation_strings":["The Automated Scheduling, optimisAtion and Planning (ASAP) Research Group, University of Nottingham, UK","Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Automated Scheduling, optimisAtion and Planning (ASAP) Research Group, University of Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113529787","display_name":"Sanja Petrovi\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sanja Petrovic","raw_affiliation_strings":["The Automated Scheduling, optimisAtion and Planning (ASAP) Research Group, University of Nottingham, UK","Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Automated Scheduling, optimisAtion and Planning (ASAP) Research Group, University of Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075724077","display_name":"Pepe V\u00e1zquez-Rodr\u00edguez","orcid":"https://orcid.org/0000-0001-8678-7964"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jose A. Vazquez-Rodriguez","raw_affiliation_strings":["The Automated Scheduling, optimisAtion and Planning (ASAP) Research Group, University of Nottingham, UK","Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Automated Scheduling, optimisAtion and Planning (ASAP) Research Group, University of Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034438662","display_name":"Michel Gendreau","orcid":"https://orcid.org/0000-0002-9262-3648"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michel Gendreau","raw_affiliation_strings":["The Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Montreal, Canada","Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT) Montreal, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Montreal, Canada","institution_ids":[]},{"raw_affiliation_string":"Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT) Montreal, Canada","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":24.4015,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.99853346,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7846741676330566},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7157878875732422},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.6725234985351562},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5751618146896362},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.49583086371421814},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4585956633090973},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.4584594964981079},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4391889274120331},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4318169951438904},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4295985698699951},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.3821806311607361},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3604785203933716},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33915892243385315},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23759528994560242},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18913906812667847},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.11561426520347595}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7846741676330566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7157878875732422},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.6725234985351562},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5751618146896362},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.49583086371421814},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4585956633090973},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.4584594964981079},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4391889274120331},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4318169951438904},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4295985698699951},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3821806311607361},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3604785203933716},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33915892243385315},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23759528994560242},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18913906812667847},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.11561426520347595},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cec.2010.5586064","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2010.5586064","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.221.7514","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.7514","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.nott.ac.uk/%7Eekb/Publications/CEC-Adaptive.pdf","raw_type":"text"},{"id":"pmh:oai:publications.polymtl.ca:52427","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/52427/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication de conf\u00e9rence"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2502392951","display_name":null,"funder_award_id":"EP/D027039/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5147293183","display_name":null,"funder_award_id":"EP/D061571/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W78763269","https://openalex.org/W178407265","https://openalex.org/W1507363803","https://openalex.org/W1516301787","https://openalex.org/W1539029254","https://openalex.org/W1543258308","https://openalex.org/W1549353496","https://openalex.org/W1572150798","https://openalex.org/W1572910922","https://openalex.org/W1668207500","https://openalex.org/W1794976143","https://openalex.org/W1814515812","https://openalex.org/W1849813686","https://openalex.org/W1965057580","https://openalex.org/W1977133017","https://openalex.org/W1987220363","https://openalex.org/W2006319903","https://openalex.org/W2006672883","https://openalex.org/W2006751452","https://openalex.org/W2013067314","https://openalex.org/W2030910540","https://openalex.org/W2040233042","https://openalex.org/W2043862089","https://openalex.org/W2056956492","https://openalex.org/W2061005345","https://openalex.org/W2090069860","https://openalex.org/W2109101401","https://openalex.org/W2114620686","https://openalex.org/W2116712480","https://openalex.org/W2132519943","https://openalex.org/W2140759234","https://openalex.org/W2148948822","https://openalex.org/W2155312717","https://openalex.org/W2156391157","https://openalex.org/W2171615581","https://openalex.org/W2238166365","https://openalex.org/W2395284556","https://openalex.org/W2976664243","https://openalex.org/W3036035835","https://openalex.org/W3121748795","https://openalex.org/W6603227577","https://openalex.org/W6630399596","https://openalex.org/W6630838125","https://openalex.org/W6632372520","https://openalex.org/W6639101744","https://openalex.org/W6666121355","https://openalex.org/W6681030992","https://openalex.org/W6779748562"],"related_works":["https://openalex.org/W2083844986","https://openalex.org/W2005660029","https://openalex.org/W2887485518","https://openalex.org/W1996453501","https://openalex.org/W4394238759","https://openalex.org/W1666350026","https://openalex.org/W2346455737","https://openalex.org/W3081534731","https://openalex.org/W4211243022","https://openalex.org/W90886653"],"abstract_inverted_index":{"An":[0],"important":[1],"challenge":[2,172],"within":[3],"hyper-heuristic":[4],"research":[5],"is":[6,73,125,140,173],"to":[7,143,187],"design":[8,178],"search":[9,97,117],"methodologies":[10],"that":[11,170,182],"work":[12],"well,":[13],"not":[14],"only":[15],"across":[16,25],"different":[17,26,37],"instances":[18],"of":[19,69,78,80,95,114,127,179],"the":[20,56,81,92,104,112,119,128,147,171,177,188],"same":[21,57],"problem,":[22],"but":[23],"also":[24],"problem":[27],"domains.":[28],"This":[29],"article":[30],"conducts":[31],"an":[32],"empirical":[33],"study":[34,72],"involving":[35],"three":[36],"domains":[38],"in":[39],"combinatorial":[40],"optimisation:":[41],"bin":[42],"packing,":[43],"permutation":[44],"flow":[45],"shop":[46],"and":[47,84,101,108,163,185,192,195],"personnel":[48],"scheduling.":[49],"Using":[50],"a":[51,76,88,137,157],"common":[52],"software":[53],"interface":[54,83],"(HyFlex),":[55],"algorithms":[58,100,181],"(high-level":[59],"strategies":[60],"or":[61],"hyper-heuristics)":[62],"can":[63,183],"be":[64],"readily":[65],"run":[66],"on":[67],"all":[68],"them.":[70],"The":[71],"intended":[74],"as":[75,87,136],"proof":[77],"concept":[79],"proposed":[82],"domain":[85],"modules,":[86],"benchmark":[89],"for":[90,176],"testing":[91],"generalisation":[93],"abilities":[94],"heuristic":[96],"algorithms.":[98],"Several":[99],"variants":[102],"from":[103],"literature":[105],"were":[106],"implemented":[107],"tested.":[109],"From":[110],"them,":[111],"implementation":[113],"iterated":[115],"local":[116,161],"produced":[118],"best":[120],"overall":[121],"performance.":[122],"Interestingly,":[123],"this":[124],"one":[126],"most":[129],"conceptually":[130],"simple":[131,148],"competing":[132],"algorithms,":[133],"its":[134,165],"advantage":[135],"robust":[138,180],"algorithm":[139],"probably":[141],"due":[142],"two":[144],"factors:":[145],"(i)":[146],"yet":[149],"powerful":[150],"exploration/exploitation":[151],"balance":[152],"achieved":[153],"by":[154,160],"systematically":[155],"combining":[156],"perturbation":[158],"followed":[159],"search;":[162],"(ii)":[164],"parameter-less":[166],"nature.":[167],"We":[168],"believe":[169],"still":[174],"open":[175],"learn":[184],"adapt":[186],"available":[189],"low-level":[190],"heuristics,":[191],"thus":[193],"select":[194],"apply":[196],"them":[197],"accordingly.":[198]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":10}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}