{"id":"https://openalex.org/W2007567004","doi":"https://doi.org/10.1109/cec.2013.6557885","title":"Using learning classifier systems to design selective hyper-heuristics for constraint satisfaction problems","display_name":"Using learning classifier systems to design selective hyper-heuristics for constraint satisfaction problems","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2007567004","doi":"https://doi.org/10.1109/cec.2013.6557885","mag":"2007567004"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2013.6557885","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557885","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"article","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/A5027131130","display_name":"Jos\u00e9 Carlos Ort\u00edz-Bayliss","orcid":"https://orcid.org/0000-0003-3408-2166"},"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":true,"raw_author_name":"Jose C. Ortiz-Bayliss","raw_affiliation_strings":["Automated Scheduling, University of Nottingham, UK","School of Computer Science; University of Nottingham; Nottingham UK"],"affiliations":[{"raw_affiliation_string":"Automated Scheduling, University of Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"School of Computer Science; University of Nottingham; Nottingham UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049386377","display_name":"Hugo Terashima\u2010Mar\u00edn","orcid":"https://orcid.org/0000-0002-5320-0773"},"institutions":[{"id":"https://openalex.org/I98461037","display_name":"Tecnol\u00f3gico de Monterrey","ror":"https://ror.org/03ayjn504","country_code":"MX","type":"education","lineage":["https://openalex.org/I98461037"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Hugo Terashima-Marin","raw_affiliation_strings":["Tecnol\u00f3gico de Monterrey, Monterrey, Mexico","Tecnol. de Monterrey, Monterrey, Mexico"],"affiliations":[{"raw_affiliation_string":"Tecnol\u00f3gico de Monterrey, Monterrey, Mexico","institution_ids":["https://openalex.org/I98461037"]},{"raw_affiliation_string":"Tecnol. de Monterrey, Monterrey, Mexico","institution_ids":["https://openalex.org/I98461037"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028807044","display_name":"Santiago Enrique Conant-Pablos","orcid":"https://orcid.org/0000-0001-6270-3164"},"institutions":[{"id":"https://openalex.org/I98461037","display_name":"Tecnol\u00f3gico de Monterrey","ror":"https://ror.org/03ayjn504","country_code":"MX","type":"education","lineage":["https://openalex.org/I98461037"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Santiago E. Conant-Pablos","raw_affiliation_strings":["Tecnol\u00f3gico de Monterrey, Monterrey, Mexico","Tecnol. de Monterrey, Monterrey, Mexico"],"affiliations":[{"raw_affiliation_string":"Tecnol\u00f3gico de Monterrey, Monterrey, Mexico","institution_ids":["https://openalex.org/I98461037"]},{"raw_affiliation_string":"Tecnol. de Monterrey, Monterrey, Mexico","institution_ids":["https://openalex.org/I98461037"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5027131130"],"corresponding_institution_ids":["https://openalex.org/I142263535"],"apc_list":null,"apc_paid":null,"fwci":0.3778,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.65484087,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3103","issue":null,"first_page":"2618","last_page":"2625"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9848999977111816,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9678000211715698,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8739804625511169},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6917158365249634},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6485104560852051},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6478763222694397},{"id":"https://openalex.org/keywords/constraint-learning","display_name":"Constraint learning","score":0.5844578742980957},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.5231284499168396},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.4571807384490967},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.44660550355911255},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43113458156585693},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.4186268150806427},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.41059955954551697},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.3902670741081238},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3525382876396179},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.285722553730011},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25998377799987793},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25268882513046265}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8739804625511169},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6917158365249634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6485104560852051},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6478763222694397},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.5844578742980957},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.5231284499168396},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.4571807384490967},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.44660550355911255},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43113458156585693},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4186268150806427},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.41059955954551697},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.3902670741081238},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3525382876396179},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.285722553730011},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25998377799987793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25268882513046265},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.0},{"id":"https://openalex.org/C188888258","wikidata":"https://www.wikidata.org/wiki/Q7353390","display_name":"Robot learning","level":4,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2013.6557885","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557885","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.726.8342","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.726.8342","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jcobayliss.net/papers/CEC2013b.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323037","display_name":"Instituto Tecnol\u00f3gico y de Estudios Superiores de Monterrey","ror":"https://ror.org/03ayjn504"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W18879625","https://openalex.org/W78763269","https://openalex.org/W91783410","https://openalex.org/W128150992","https://openalex.org/W1497256448","https://openalex.org/W1516312268","https://openalex.org/W1519083892","https://openalex.org/W1540533943","https://openalex.org/W1550402024","https://openalex.org/W1567870026","https://openalex.org/W1577506768","https://openalex.org/W1597474747","https://openalex.org/W1668207500","https://openalex.org/W1814515812","https://openalex.org/W1824538363","https://openalex.org/W1979914370","https://openalex.org/W1996264924","https://openalex.org/W2002478775","https://openalex.org/W2005308601","https://openalex.org/W2015865970","https://openalex.org/W2024182184","https://openalex.org/W2044742178","https://openalex.org/W2057610071","https://openalex.org/W2064902266","https://openalex.org/W2068852367","https://openalex.org/W2072755230","https://openalex.org/W2074529765","https://openalex.org/W2107731844","https://openalex.org/W2108415981","https://openalex.org/W2108702302","https://openalex.org/W2113589496","https://openalex.org/W2114620686","https://openalex.org/W2121766240","https://openalex.org/W2135432705","https://openalex.org/W2150808876","https://openalex.org/W2397399790","https://openalex.org/W3037058914","https://openalex.org/W4233536073","https://openalex.org/W4285719527","https://openalex.org/W6603227577","https://openalex.org/W6630966012","https://openalex.org/W6633993936","https://openalex.org/W6635490985","https://openalex.org/W6638335760","https://openalex.org/W6676315596","https://openalex.org/W6676428428","https://openalex.org/W6677108325","https://openalex.org/W6712210503","https://openalex.org/W6776626634","https://openalex.org/W6834526511","https://openalex.org/W7042940515"],"related_works":["https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W2737098235","https://openalex.org/W2141935412","https://openalex.org/W2017710358","https://openalex.org/W3035232911","https://openalex.org/W2495408185","https://openalex.org/W1535766026","https://openalex.org/W2358226081"],"abstract_inverted_index":{"Constraint":[0],"satisfaction":[1],"problems":[2],"(CSP)":[3],"are":[4,82,197],"defined":[5],"by":[6],"a":[7,15,26,59,62,71,99,147,170,176],"set":[8,27,148],"of":[9,17,28,73,89,97,135,149,173,225],"variables,":[10],"where":[11,67],"each":[12,68],"variable":[13,72,112,150,227],"contains":[14],"series":[16],"values":[18,37],"it":[19,185],"can":[20,39],"be":[21,123,204],"instantiated":[22],"with.":[23],"There":[24],"is":[25,44,65,211],"constraints":[29],"among":[30],"the":[31,35,51,74,80,87,90,95,110,116,133,155,160,179,187,222,226],"variables":[32,52,81],"that":[33,143,157],"restrict":[34],"different":[36],"they":[38,119],"take":[40],"simultaneously.":[41],"The":[42,76,209],"task":[43],"to":[45,49,106,108,113,122,139,166,203,221],"find":[46],"one":[47,156],"assignment":[48],"all":[50],"without":[53],"breaking":[54],"any":[55],"constraint.":[56],"To":[57],"solve":[58],"CSP":[60],"instance,":[61],"search":[63,91,117,188],"tree":[64,92],"created":[66],"node":[69],"represents":[70],"instance.":[75],"order":[77,165],"in":[78,164,206,231],"which":[79],"selected":[83],"for":[84,125,153],"instantiation":[85],"changes":[86],"form":[88],"and":[93,118,199],"affects":[94],"cost":[96],"finding":[98],"solution.":[100],"Many":[101],"heuristics":[102,152,229],"have":[103,120],"been":[104],"proposed":[105],"help":[107],"decide":[109],"next":[111],"instantiate":[114],"during":[115],"proved":[121],"helpful":[124],"some":[126],"instances.":[127,174],"In":[128],"this":[129],"paper":[130],"we":[131],"explore":[132],"use":[134],"learning":[136],"classifier":[137],"systems":[138],"construct":[140],"selective":[141],"hyper-heuristics":[142],"dynamically":[144],"select,":[145],"from":[146],"ordering":[151,228],"CSPs,":[154],"best":[158],"matches":[159],"current":[161],"problem":[162],"state":[163],"perform":[167],"well":[168],"on":[169,213],"wide":[171],"range":[172],"During":[175],"training":[177],"phase,":[178],"system":[180],"constructs":[181],"state-heuristic":[182],"rules":[183],"as":[184],"explores":[186],"space.":[189],"Heuristics":[190],"with":[191,219],"good":[192],"performance":[193,224],"at":[194],"certain":[195],"points":[196],"rewarded":[198],"become":[200],"more":[201],"likely":[202],"applied":[205],"similar":[207],"situations.":[208],"approach":[210],"tested":[212],"random":[214],"instances,":[215],"providing":[216],"promising":[217],"results":[218],"respect":[220],"median":[223],"used":[230],"isolation.":[232]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}