{"id":"https://openalex.org/W2070391230","doi":"https://doi.org/10.1145/1899503.1899531","title":"An empirical study into the structure of heuristic combinations in an evolutionary algorithm hyper-heuristic for the examination timetabling problem","display_name":"An empirical study into the structure of heuristic combinations in an evolutionary algorithm hyper-heuristic for the examination timetabling problem","publication_year":2010,"publication_date":"2010-10-11","ids":{"openalex":"https://openalex.org/W2070391230","doi":"https://doi.org/10.1145/1899503.1899531","mag":"2070391230"},"language":"en","primary_location":{"id":"doi:10.1145/1899503.1899531","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1899503.1899531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists","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/A5060039893","display_name":"Nelishia Pillay","orcid":"https://orcid.org/0000-0003-3902-5582"},"institutions":[{"id":"https://openalex.org/I95023434","display_name":"University of KwaZulu-Natal","ror":"https://ror.org/04qzfn040","country_code":"ZA","type":"education","lineage":["https://openalex.org/I95023434"]}],"countries":["ZA"],"is_corresponding":true,"raw_author_name":"Nelishia Pillay","raw_affiliation_strings":["University of KwaZulu-Natal, KwaZulu-Natal, South Africa","University of KwaZulu-Natal, KwaZulu-Natal, South Africa#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of KwaZulu-Natal, KwaZulu-Natal, South Africa","institution_ids":["https://openalex.org/I95023434"]},{"raw_affiliation_string":"University of KwaZulu-Natal, KwaZulu-Natal, South Africa#TAB#","institution_ids":["https://openalex.org/I95023434"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5060039893"],"corresponding_institution_ids":["https://openalex.org/I95023434"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"251","last_page":"257"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9817000031471252,"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/T11064","display_name":"Antiplatelet Therapy and Cardiovascular Diseases","score":0.907800018787384,"subfield":{"id":"https://openalex.org/subfields/2705","display_name":"Cardiology and Cardiovascular Medicine"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7632945775985718},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7291368246078491},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.7213065028190613},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6175736784934998},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5961498022079468},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5612713694572449},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5239396691322327},{"id":"https://openalex.org/keywords/null-move-heuristic","display_name":"Null-move heuristic","score":0.4887661933898926},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.4342942535877228},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43165507912635803},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4295960068702698},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3637784421443939},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3523549735546112},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.33286145329475403},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.2526942491531372},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.23327112197875977}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7632945775985718},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7291368246078491},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.7213065028190613},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6175736784934998},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5961498022079468},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5612713694572449},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5239396691322327},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.4887661933898926},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.4342942535877228},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43165507912635803},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4295960068702698},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3637784421443939},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3523549735546112},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.33286145329475403},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.2526942491531372},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.23327112197875977},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"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/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1899503.1899531","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1899503.1899531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W207226807","https://openalex.org/W1504849040","https://openalex.org/W1567102157","https://openalex.org/W1576818901","https://openalex.org/W1589105414","https://openalex.org/W1995115352","https://openalex.org/W1995123252","https://openalex.org/W2011653811","https://openalex.org/W2014856631","https://openalex.org/W2021796553","https://openalex.org/W2086726443","https://openalex.org/W2092856865","https://openalex.org/W2109916763","https://openalex.org/W2613087635","https://openalex.org/W6831022397"],"related_works":["https://openalex.org/W3111117784","https://openalex.org/W2400861930","https://openalex.org/W2101174032","https://openalex.org/W2617599361","https://openalex.org/W2573689326","https://openalex.org/W1140243306","https://openalex.org/W2146538994","https://openalex.org/W3097720710","https://openalex.org/W2913108234","https://openalex.org/W2357125654"],"abstract_inverted_index":{"A":[0,61],"hyper-heuristic":[1,41,103,142,203],"for":[2,52,104],"the":[3,28,34,49,59,72,86,89,93,96,105,140,162,170,173,179,207],"examination":[4,19,35,107,154],"timetabling":[5,108,155],"problem":[6,56],"searches":[7],"a":[8,16,40,125,149],"space":[9,17],"of":[10,15,18,39,88,95,98,139,151,172,185],"constructive":[11],"heuristic":[12,24,73,90],"combinations":[13],"instead":[14],"timetables.":[20],"The":[21,37,137,157,190],"most":[22],"optimal":[23],"combination":[25,91,181],"found":[26,197],"by":[27],"search":[29,97],"is":[30,42,67,146],"used":[31,164],"to":[32,43,70,83,198,206],"construct":[33],"timetable.":[36],"focus":[38],"generalize":[44],"well":[45],"rather":[46],"than":[47,201],"producing":[48],"best":[50],"result":[51],"one":[53,113],"or":[54],"more":[55],"sets":[57],"in":[58],"domain.":[60],"metaheuristic":[62],"such":[63],"as":[64],"evolutionary":[65,100,174],"algorithms":[66],"usually":[68],"employed":[69],"explore":[71],"space.":[74],"This":[75],"study":[76,158],"reports":[77],"on":[78,148,169],"an":[79,99,167],"empirical":[80],"investigation":[81],"conducted":[82],"test":[84],"how":[85],"structure":[87],"affects":[92],"success":[94,171],"algorithm":[101],"(EA)":[102],"uncapacitated":[106,153],"problem.":[109,209],"Two":[110],"structures,":[111],"namely,":[112],"that":[114,161],"combines":[115,128],"low-level":[116],"construction":[117],"heuristics":[118,129,186],"linearly,":[119],"and":[120,124,131,182],"applies":[121,132],"them":[122,133],"sequentially":[123],"second":[126],"which":[127],"hierarchically":[130],"simultaneously":[134],"are":[135],"investigated.":[136],"performance":[138],"EA-based":[141],"using":[143],"both":[144,193],"structures":[145],"tested":[147],"set":[150],"eight":[152],"problems.":[156],"has":[159],"revealed":[160],"representation":[163],"does":[165],"have":[166],"impact":[168],"algorithm.":[175],"In":[176],"this":[177],"domain":[178],"linear":[180],"sequential":[183],"application":[184],"produced":[187],"better":[188,200],"results.":[189],"EAs":[191],"with":[192],"representations":[194],"were":[195],"also":[196],"perform":[199],"other":[202],"methods":[204],"applied":[205],"same":[208]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}