{"id":"https://openalex.org/W1976289370","doi":"https://doi.org/10.1109/cec.2013.6557975","title":"Exploring heuristic interactions in constraint satisfaction problems: A closer look at the hyper-heuristic space","display_name":"Exploring heuristic interactions in constraint satisfaction problems: A closer look at the hyper-heuristic space","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W1976289370","doi":"https://doi.org/10.1109/cec.2013.6557975","mag":"1976289370"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2013.6557975","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557975","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, Optimisation and Planning (ASAP), School of Computer Science, University of Nottingham, UK","School of Computer Science; University of Nottingham; Nottingham UK"],"affiliations":[{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning (ASAP), School of Computer Science, 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","Tecnolgico de Monterrey, Monterrey, Mexico"],"affiliations":[{"raw_affiliation_string":"Tecnol\u00f3gico de Monterrey, Monterrey, Mexico","institution_ids":["https://openalex.org/I98461037"]},{"raw_affiliation_string":"Tecnolgico de Monterrey, Monterrey, Mexico","institution_ids":["https://openalex.org/I98461037"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020026827","display_name":"Ender \u00d6zcan","orcid":"https://orcid.org/0000-0003-0276-1391"},"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":"Ender Ozcan","raw_affiliation_strings":["Automated Scheduling, Optimisation and Planning (ASAP), School of Computer Science, University of Nottingham, UK","School of Computer Science; University of Nottingham; Nottingham UK"],"affiliations":[{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning (ASAP), School of Computer Science, 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/A5049853918","display_name":"Andrew Parkes","orcid":"https://orcid.org/0000-0002-8847-1856"},"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":"Andrew J. Parkes","raw_affiliation_strings":["Automated Scheduling, Optimisation and Planning (ASAP), School of Computer Science, University of Nottingham, UK","School of Computer Science; University of Nottingham; Nottingham UK"],"affiliations":[{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning (ASAP), School of Computer Science, 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":"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","Tecnolgico de Monterrey, Monterrey, Mexico"],"affiliations":[{"raw_affiliation_string":"Tecnol\u00f3gico de Monterrey, Monterrey, Mexico","institution_ids":["https://openalex.org/I98461037"]},{"raw_affiliation_string":"Tecnolgico de Monterrey, Monterrey, Mexico","institution_ids":["https://openalex.org/I98461037"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5027131130"],"corresponding_institution_ids":["https://openalex.org/I142263535"],"apc_list":null,"apc_paid":null,"fwci":1.131,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.79842506,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"136","issue":null,"first_page":"3307","last_page":"3314"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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.9998999834060669,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9952999949455261,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.9322705268859863},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7895324230194092},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6550483703613281},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6182284355163574},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5406444072723389},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5031647086143494},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.47873732447624207},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.4769127070903778},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4518257975578308},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.43693995475769043},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3523573875427246},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3434985280036926},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27049940824508667},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20491915941238403}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.9322705268859863},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7895324230194092},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6550483703613281},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6182284355163574},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5406444072723389},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5031647086143494},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.47873732447624207},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.4769127070903778},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4518257975578308},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.43693995475769043},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3523573875427246},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3434985280036926},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27049940824508667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20491915941238403},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2013.6557975","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557975","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.359.2345","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.359.2345","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/~ajp/pubs/CEC2013-hyper-heuristics-CSP.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1956160721","display_name":null,"funder_award_id":"EP/F033214/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6414137052","display_name":null,"funder_award_id":"EP/H000968/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320323037","display_name":"Instituto Tecnol\u00f3gico y de Estudios Superiores de Monterrey","ror":"https://ror.org/03ayjn504"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W18879625","https://openalex.org/W78763269","https://openalex.org/W1495775210","https://openalex.org/W1540533943","https://openalex.org/W1561612513","https://openalex.org/W1567870026","https://openalex.org/W1568944559","https://openalex.org/W1601028465","https://openalex.org/W1620410031","https://openalex.org/W1668207500","https://openalex.org/W1745341198","https://openalex.org/W1814515812","https://openalex.org/W1996264924","https://openalex.org/W1998738752","https://openalex.org/W2005308601","https://openalex.org/W2015865970","https://openalex.org/W2024182184","https://openalex.org/W2044742178","https://openalex.org/W2061423471","https://openalex.org/W2068852367","https://openalex.org/W2071639741","https://openalex.org/W2072755230","https://openalex.org/W2074529765","https://openalex.org/W2076230473","https://openalex.org/W2076238572","https://openalex.org/W2107731844","https://openalex.org/W2135432705","https://openalex.org/W2143095460","https://openalex.org/W2162642735","https://openalex.org/W2169209574","https://openalex.org/W2227618531","https://openalex.org/W2623293810","https://openalex.org/W4285719527","https://openalex.org/W6603227577","https://openalex.org/W6633928019","https://openalex.org/W6633993936","https://openalex.org/W6636690859","https://openalex.org/W6776626634"],"related_works":["https://openalex.org/W2081821176","https://openalex.org/W2358427436","https://openalex.org/W1994919150","https://openalex.org/W4386269615","https://openalex.org/W2064794194","https://openalex.org/W2402589461","https://openalex.org/W4200104947","https://openalex.org/W58921990","https://openalex.org/W2808808802","https://openalex.org/W2204575588"],"abstract_inverted_index":{"Variable":[0],"ordering":[1,27,48,109],"has":[2],"been":[3,30,96],"a":[4,79],"recurrent":[5],"topic":[6],"of":[7,12,16,22,43,52,63,70,105,126,150,190,198],"study":[8,45,83],"in":[9,19,129,153,187,203],"the":[10,20,23,35,44,50,56,61,64,68,76,103,118,124,127,130,151,154,162,179,188,191,196,199],"field":[11],"constraint":[13],"satisfaction":[14],"because":[15],"its":[17],"impact":[18],"cost":[21,62,155,189],"search.":[24,65],"Various":[25],"variable":[26,47,108],"heuristics":[28,54,72,85,110,158,177,201],"have":[29,95],"proposed":[31],"to":[32,59,75,86,120,184,195],"help":[33],"guiding":[34],"search":[36,57,131,163,180,192],"under":[37],"different":[38,157],"situations.":[39],"One":[40],"important":[41,107,185],"direction":[42],"about":[46],"is":[49],"use":[51,87],"distinct":[53,176],"as":[55,178],"progresses":[58,181],"reduce":[60],"Even":[66],"though":[67],"idea":[69],"combining":[71,112],"goes":[73],"back":[74],"60's,":[77],"only":[78],"few":[80],"works":[81],"that":[82,116,173],"which":[84],"and":[88],"how":[89],"they":[90],"interact":[91],"with":[92,193],"each":[93],"other":[94],"described.":[97],"In":[98],"this":[99],"investigation,":[100],"we":[101],"analyse":[102],"interactions":[104],"four":[106],"by":[111,164],"them":[113],"through":[114],"hyper-heuristics":[115],"decide":[117],"heuristic":[119],"apply":[121],"based":[122],"on":[123],"depth":[125],"nodes":[128],"tree.":[132],"The":[133,170],"paper":[134],"does":[135],"not":[136],"include":[137],"any":[138],"specific":[139],"model":[140],"for":[141],"generating":[142],"such":[143],"hyperheuristics;":[144],"instead,":[145],"it":[146],"presents":[147],"an":[148],"analysis":[149],"changes":[152],"when":[156],"are":[159],"applied":[160],"during":[161],"using":[165],"one":[166],"simple":[167],"hyper-heuristic":[168],"representation.":[169],"results":[171],"show":[172],"selectively":[174],"applying":[175],"may":[182],"lead":[183],"reductions":[186],"respect":[194],"performance":[197],"same":[200],"used":[202],"isolation.":[204]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}