{"id":"https://openalex.org/W2038104061","doi":"https://doi.org/10.1109/ukci.2012.6335754","title":"A greedy gradient-simulated annealing hyper-heuristic for a curriculum-based course timetabling problem","display_name":"A greedy gradient-simulated annealing hyper-heuristic for a curriculum-based course timetabling problem","publication_year":2012,"publication_date":"2012-09-01","ids":{"openalex":"https://openalex.org/W2038104061","doi":"https://doi.org/10.1109/ukci.2012.6335754","mag":"2038104061"},"language":"en","primary_location":{"id":"doi:10.1109/ukci.2012.6335754","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ukci.2012.6335754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/conference_contribution/A_greedy_gradient-simulated_annealing_hyper-heuristic_for_a_curriculum-based_course_timetabling_problem/29702993","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074416899","display_name":"Murat Kalender","orcid":"https://orcid.org/0000-0002-9088-2582"},"institutions":[{"id":"https://openalex.org/I100072489","display_name":"Yeditepe University","ror":"https://ror.org/025mx2575","country_code":"TR","type":"education","lineage":["https://openalex.org/I100072489"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Murat Kalender","raw_affiliation_strings":["Yeditepe University, Computer Engineering Department, Kadikoy/Istanbul, Turkey","Yeditepe University, Computer Engineering Department, Inonu Mh., Kayisdagi Cd., 34755 Kadikoy/Istanbul, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yeditepe University, Computer Engineering Department, Kadikoy/Istanbul, Turkey","institution_ids":["https://openalex.org/I100072489"]},{"raw_affiliation_string":"Yeditepe University, Computer Engineering Department, Inonu Mh., Kayisdagi Cd., 34755 Kadikoy/Istanbul, Turkey","institution_ids":["https://openalex.org/I100072489"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017573824","display_name":"Ahmed Kheiri","orcid":"https://orcid.org/0000-0002-6716-2130"},"institutions":[{"id":"https://openalex.org/I100072489","display_name":"Yeditepe University","ror":"https://ror.org/025mx2575","country_code":"TR","type":"education","lineage":["https://openalex.org/I100072489"]},{"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","TR"],"is_corresponding":false,"raw_author_name":"Ahmed Kheiri","raw_affiliation_strings":["Yeditepe University, Computer Engineering Department, Kadikoy/Istanbul, Turkey","University of Nottingham, School of Computer Science, Jubilee Campus, Wollaton Road, NG8 1BB, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yeditepe University, Computer Engineering Department, Kadikoy/Istanbul, Turkey","institution_ids":["https://openalex.org/I100072489"]},{"raw_affiliation_string":"University of Nottingham, School of Computer Science, Jubilee Campus, Wollaton Road, NG8 1BB, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"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":["University of Nottingham, Nottingham, Nottinghamshire, GB","University of Nottingham, School of Computer Science, Jubilee Campus, Wollaton Road, NG8 1BB, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nottingham, Nottingham, Nottinghamshire, GB","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"University of Nottingham, School of Computer Science, Jubilee Campus, Wollaton Road, NG8 1BB, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004567468","display_name":"Edmund Burke","orcid":"https://orcid.org/0000-0003-0712-4762"},"institutions":[{"id":"https://openalex.org/I12093191","display_name":"University of Stirling","ror":"https://ror.org/045wgfr59","country_code":"GB","type":"education","lineage":["https://openalex.org/I12093191"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Edmund K. Burke","raw_affiliation_strings":["University of Stirling, Stirling, UK","University of Stirling, Cottrell Building, Stirling FK9 4LA, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Stirling, Stirling, UK","institution_ids":["https://openalex.org/I12093191"]},{"raw_affiliation_string":"University of Stirling, Cottrell Building, Stirling FK9 4LA, UK","institution_ids":["https://openalex.org/I12093191"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":null,"first_page":"1","last_page":"8"},"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.9592999815940857,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9502999782562256,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8624136447906494},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6795646548271179},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6681187748908997},{"id":"https://openalex.org/keywords/generality","display_name":"Generality","score":0.6605603694915771},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.6294959187507629},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6103527545928955},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5425072908401489},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4534653425216675},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31396859884262085},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2655360698699951},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23992645740509033},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19769194722175598}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8624136447906494},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6795646548271179},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6681187748908997},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.6605603694915771},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.6294959187507629},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6103527545928955},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5425072908401489},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4534653425216675},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31396859884262085},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2655360698699951},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23992645740509033},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19769194722175598},{"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},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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":7,"locations":[{"id":"doi:10.1109/ukci.2012.6335754","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ukci.2012.6335754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.stir.ac.uk:1893/15712","is_oa":false,"landing_page_url":"http://hdl.handle.net/1893/15712","pdf_url":null,"source":{"id":"https://openalex.org/S4306400268","display_name":"Stirling Online Research Repository (University of Stirling)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I12093191","host_organization_name":"University of Stirling","host_organization_lineage":["https://openalex.org/I12093191"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"},{"id":"pmh:oai:eprints.lancs.ac.uk:134220","is_oa":false,"landing_page_url":"https://eprints.lancs.ac.uk/id/eprint/134220/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401916","display_name":"Lancaster EPrints (Lancaster University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67415387","host_organization_name":"Lancaster University","host_organization_lineage":["https://openalex.org/I67415387"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Contribution in Book/Report/Proceedings"},{"id":"pmh:oai:figshare.com:article/29702993","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/A_greedy_gradient-simulated_annealing_hyper-heuristic_for_a_curriculum-based_course_timetabling_problem/29702993","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference contribution"},{"id":"pmh:oai:https://orca.cardiff.ac.uk:85724","is_oa":false,"landing_page_url":"https://orca.cardiff.ac.uk/id/eprint/85724/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401195","display_name":"ORCA Online Research @Cardiff (Cardiff University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79510175","host_organization_name":"Cardiff University","host_organization_lineage":["https://openalex.org/I79510175"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},{"id":"pmh:oai:ore.exeter.ac.uk:10871/15562","is_oa":false,"landing_page_url":"http://hdl.handle.net/10871/15562","pdf_url":null,"source":{"id":"https://openalex.org/S4306401998","display_name":"Open Research Exeter (University of Exeter)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I23923803","host_organization_name":"University of Exeter","host_organization_lineage":["https://openalex.org/I23923803"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference paper"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/fd2f35c7-6736-499f-ac4c-a762a2b69fd6","is_oa":true,"landing_page_url":"https://research.manchester.ac.uk/en/publications/fd2f35c7-6736-499f-ac4c-a762a2b69fd6","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kalender, M, Kheiri, A, \u00d6zcan, E & Burke, E K 2012, A greedy gradient-simulated annealing hyper-heuristic for a curriculum-based course timetabling problem. in 2012 12th UK Workshop on Computational Intelligence, UKCI 2012., 6335754, 2012 12th UK Workshop on Computational Intelligence, UKCI 2012, IEEE, 2012 12th UK Workshop on Computational Intelligence, UKCI 2012, Edinburgh, United Kingdom, 5/09/12. https://doi.org/10.1109/UKCI.2012.6335754","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/29702993","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/A_greedy_gradient-simulated_annealing_hyper-heuristic_for_a_curriculum-based_course_timetabling_problem/29702993","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference contribution"},"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.5}],"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"}],"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":40,"referenced_works":["https://openalex.org/W1518679956","https://openalex.org/W1545459265","https://openalex.org/W1549353496","https://openalex.org/W1570709358","https://openalex.org/W1745341198","https://openalex.org/W1787640033","https://openalex.org/W1814515812","https://openalex.org/W1829921621","https://openalex.org/W1857496909","https://openalex.org/W1883366561","https://openalex.org/W1963988630","https://openalex.org/W1969577093","https://openalex.org/W1970604725","https://openalex.org/W1988376894","https://openalex.org/W1989507398","https://openalex.org/W2003160050","https://openalex.org/W2011716148","https://openalex.org/W2015097024","https://openalex.org/W2028379670","https://openalex.org/W2028480548","https://openalex.org/W2056956492","https://openalex.org/W2072441740","https://openalex.org/W2086961057","https://openalex.org/W2113836425","https://openalex.org/W2126637747","https://openalex.org/W2133424441","https://openalex.org/W2135474087","https://openalex.org/W2138029669","https://openalex.org/W2140759234","https://openalex.org/W2161393961","https://openalex.org/W2165292950","https://openalex.org/W2188476713","https://openalex.org/W2238166365","https://openalex.org/W2399362491","https://openalex.org/W2949988553","https://openalex.org/W4285719527","https://openalex.org/W6631088941","https://openalex.org/W6642630038","https://openalex.org/W6677148928","https://openalex.org/W6686621287"],"related_works":["https://openalex.org/W2084470113","https://openalex.org/W3119129187","https://openalex.org/W1628567638","https://openalex.org/W2109775141","https://openalex.org/W3186374002","https://openalex.org/W2526745971","https://openalex.org/W2521454154","https://openalex.org/W2107678394","https://openalex.org/W2521049309","https://openalex.org/W2020754965"],"abstract_inverted_index":{"The":[0,114,183],"course":[1,74],"timetabling":[2,75],"problem":[3,10,76,166],"is":[4,80,108,150,161,171,191],"a":[5,38,42,71,90,96,99,122,127,145],"well":[6,19],"known":[7],"constraint":[8,104],"optimization":[9],"which":[11,46,154],"has":[12],"been":[13,61],"of":[14,27,50,101,124,136,147,181],"interest":[15],"to":[16,23,36,120,151,163,173,177],"researchers":[17],"as":[18,20,95],"practitioners.":[21],"Due":[22],"the":[24,28,30,48,134,137,142,158,188],"NP-hard":[25],"nature":[26,135],"problem,":[29],"traditional":[31],"exact":[32],"approaches":[33],"might":[34],"fail":[35],"find":[37],"solution":[39],"even":[40],"for":[41,52,110],"given":[43],"instance.":[44],"Hyper-heuristics":[45],"search":[47],"space":[49],"heuristics":[51,107],"high":[53],"quality":[54],"solutions":[55],"are":[56,155],"alternative":[57],"methods":[58,153],"that":[59,187],"have":[60],"increasingly":[62],"used":[63],"in":[64,126],"solving":[65,111],"such":[66],"problems.":[67],"In":[68],"this":[69,112],"study,":[70],"curriculum":[72],"based":[73],"at":[77],"Yeditepe":[78],"University":[79],"described.":[81],"An":[82],"improvement":[83],"oriented":[84,105],"heuristic":[85],"selection":[86],"strategy":[87],"combined":[88],"with":[89,130],"simulated":[91],"annealing":[92],"move":[93],"acceptance":[94],"hyper-heuristic":[97,116,148,160],"utilizing":[98],"set":[100],"low":[102,138],"level":[103,139,180],"neighbourhood":[106],"investigated":[109],"problem.":[113],"proposed":[115,159,189],"was":[117],"initially":[118],"developed":[119],"handle":[121],"variety":[123],"problems":[125],"particular":[128],"domain":[129],"different":[131,174],"properties":[132],"considering":[133],"heuristics.":[140],"On":[141],"other":[143,165],"hand,":[144],"goal":[146],"development":[149],"build":[152],"general.":[156],"Hence,":[157],"applied":[162],"six":[164],"domains":[167],"and":[168,194],"its":[169,179],"performance":[170],"compared":[172],"state-of-the-art":[175],"hyper-heuristics":[176],"test":[178],"generality.":[182],"empirical":[184],"results":[185],"show":[186],"method":[190],"sufficiently":[192],"general":[193],"powerful.":[195]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}