{"id":"https://openalex.org/W2113589496","doi":"https://doi.org/10.1109/cec.2005.1554866","title":"Constructive Hyper-heuristics in Class Timetabling","display_name":"Constructive Hyper-heuristics in Class Timetabling","publication_year":2005,"publication_date":"2005-12-13","ids":{"openalex":"https://openalex.org/W2113589496","doi":"https://doi.org/10.1109/cec.2005.1554866","mag":"2113589496"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2005.1554866","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554866","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 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/A5007882217","display_name":"Peter Ross","orcid":"https://orcid.org/0000-0002-5051-5382"},"institutions":[{"id":"https://openalex.org/I251738","display_name":"Edinburgh Napier University","ror":"https://ror.org/03zjvnn91","country_code":"GB","type":"education","lineage":["https://openalex.org/I251738"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"P. Ross","raw_affiliation_strings":["School of Computing, Napier University, Edinburgh, UK","Sch. of Comput, Napier Univ., Edinburgh, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, Napier University, Edinburgh, UK","institution_ids":["https://openalex.org/I251738"]},{"raw_affiliation_string":"Sch. of Comput, Napier Univ., Edinburgh, UK","institution_ids":["https://openalex.org/I251738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039692122","display_name":"Javier G. Mar\u0131\u0301n-Bl\u00e1zquez","orcid":"https://orcid.org/0000-0003-2742-4607"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J.G. Marin-Blazquez","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8453,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.78919534,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"2","issue":null,"first_page":"1493","last_page":"1500"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":1.0,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9751999974250793,"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/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9620000123977661,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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.7693712711334229},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.6737226843833923},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6407495737075806},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5159493088722229},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5150699019432068},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5135102868080139},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49136248230934143},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.47225087881088257},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31965935230255127},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26596033573150635},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2388399839401245}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7693712711334229},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.6737226843833923},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6407495737075806},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5159493088722229},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5150699019432068},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5135102868080139},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49136248230934143},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.47225087881088257},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31965935230255127},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26596033573150635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2388399839401245},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2005.1554866","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554866","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"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":9,"referenced_works":["https://openalex.org/W16292936","https://openalex.org/W1527172735","https://openalex.org/W1824538363","https://openalex.org/W2123932009","https://openalex.org/W2167036627","https://openalex.org/W2480762398","https://openalex.org/W2623293810","https://openalex.org/W6631571155","https://openalex.org/W6638335760"],"related_works":["https://openalex.org/W2760348722","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W2067280619","https://openalex.org/W2041180560","https://openalex.org/W2176003014"],"abstract_inverted_index":{"Evolutionary":[0],"and":[1,19,28,68,107],"stochastic":[2],"problem":[3,23],"solving":[4],"techniques":[5],"are":[6,30],"often":[7],"regarded":[8],"with":[9],"caution":[10],"by":[11],"end":[12],"users":[13],"because":[14],"of":[15,79,88,142],"their":[16],"apparent":[17],"fragility":[18],"slowness.":[20],"Typically":[21],"each":[22],"is":[24,53,104,135],"solved":[25],"in":[26,95],"isolation,":[27],"results":[29],"sensitive":[31],"to":[32,54,58,85,121,139,145],"parameters.":[33],"Users":[34],"may":[35],"thus":[36],"prefer":[37],"easily":[38],"understood":[39],"but":[40],"worse":[41],"performing":[42],"heuristic":[43],"methods.":[44],"Hyper-heuristics":[45],"represents":[46],"a":[47,60,77,86,118],"way":[48],"around":[49],"this;":[50],"the":[51,124,131,140,143],"idea":[52,84],"use":[55,117],"evolutionary":[56],"methods":[57],"discover":[59],"novel":[61],"non-evolutionary":[62],"deterministic":[63],"algorithm,":[64,125],"based":[65],"on":[66],"simple":[67],"familiar":[69],"heuristics":[70],"that":[71],"has":[72],"good":[73],"worst-case":[74],"performance":[75],"across":[76],"range":[78],"problems.":[80],"We":[81],"apply":[82],"this":[83],"set":[87],"non-trivial":[89],"class":[90],"timetabling":[91,98],"problems,":[92],"formerly":[93],"used":[94],"an":[96],"international":[97],"technology":[99],"competition.":[100],"The":[101],"learnt":[102],"algorithm":[103],"fast,":[105],"greedy,":[106],"does":[108],"not":[109,136],"involve":[110],"additional":[111],"search":[112,122],"or":[113],"backtracking.":[114],"Although":[115],"we":[116],"messy":[119],"GA":[120],"for":[123],"it":[126],"also":[127],"scales":[128],"very":[129],"well;":[130],"typical":[132],"chromosome":[133],"size":[134,141],"directly":[137],"related":[138],"problems":[144],"be":[146],"solved.":[147]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}