{"id":"https://openalex.org/W2558032640","doi":"https://doi.org/10.1109/cec.2016.7744354","title":"Evolving construction heuristics for the curriculum based university course timetabling problem","display_name":"Evolving construction heuristics for the curriculum based university course timetabling problem","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2558032640","doi":"https://doi.org/10.1109/cec.2016.7744354","mag":"2558032640"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2016.7744354","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744354","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Congress on Evolutionary Computation (CEC)","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/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":["School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal, South Africa"],"affiliations":[{"raw_affiliation_string":"School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal, South Africa","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":1.4362,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.85517281,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"4437","last_page":"4443"},"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.9724000096321106,"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.9373000264167786,"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.9255911111831665},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6523475646972656},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.6213380694389343},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.5995987057685852},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5835728049278259},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5402926802635193},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5290027260780334},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3062790036201477},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2663341760635376},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1924404501914978},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.07039734721183777}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.9255911111831665},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6523475646972656},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.6213380694389343},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.5995987057685852},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5835728049278259},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5402926802635193},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5290027260780334},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3062790036201477},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2663341760635376},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1924404501914978},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.07039734721183777},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2016.7744354","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744354","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1576818901","https://openalex.org/W1998069267","https://openalex.org/W2014856631","https://openalex.org/W2026524380","https://openalex.org/W2028379670","https://openalex.org/W2043258790","https://openalex.org/W2058653357","https://openalex.org/W2091126685","https://openalex.org/W2097428991","https://openalex.org/W2112255588","https://openalex.org/W6661204435"],"related_works":["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/W2041180560","https://openalex.org/W2586529194","https://openalex.org/W1628567638","https://openalex.org/W2109775141"],"abstract_inverted_index":{"In":[0],"solving":[1],"combinatorial":[2],"optimization":[3,19],"problems":[4],"construction":[5,25,63,83,113,121,156,186,216],"heuristics":[6,26,50,64,84,122,157,166,187,210],"are":[7,27,51,167],"generally":[8,87],"used":[9,118],"to":[10,43,61,75,80,90,119],"create":[11],"an":[12],"initial":[13],"solution":[14],"which":[15],"is":[16,34,86,117,134],"improved":[17],"using":[18],"techniques":[20],"like":[21,60],"genetic":[22,178],"algorithms.":[23],"These":[24],"usually":[28,35],"derived":[29],"by":[30],"humans":[31],"and":[32,141,150,192],"this":[33],"quite":[36],"a":[37,135,142],"time":[38,77],"consuming":[39],"task.":[40],"Furthermore,":[41],"according":[42],"the":[44,76,100,105,110,124,152,177,182,189,194,197,203,214],"no":[45],"free":[46],"lunch":[47],"theorem":[48],"different":[49,54,66,165,170],"effective":[52,168],"for":[53,65,123,158,169,181,188,202],"problem":[55,67,92,139,171,191,200],"instances.":[56,172],"Ideally":[57],"we":[58],"would":[59],"derive":[62,82],"instances":[68,201],"or":[69],"classes":[70],"of":[71,104,112,138,154,185],"problems.":[72],"However,":[73],"due":[74],"it":[78,85],"takes":[79],"manually":[81],"not":[88],"feasible":[89],"induce":[91],"instance":[93],"specific":[94],"heuristics.":[95,114],"The":[96,146,160,173,208],"research":[97],"presented":[98],"in":[99],"paper":[101,147,174],"forms":[102],"part":[103],"initiative":[106],"aimed":[107],"at":[108],"automating":[109],"derivation":[111],"Genetic":[115],"programming":[116,179],"evolve":[120],"curriculum":[125],"based":[126],"university":[127],"course":[128],"timetabling":[129,206],"(CB-CTT)":[130],"problem.":[131],"Each":[132],"heuristic":[133],"hierarchical":[136],"combination":[137],"characteristics":[140],"period":[143],"selection":[144],"heuristic.":[145],"firstly":[148],"presents":[149,176],"analyses":[151],"performance":[153],"known":[155,215],"CB-CTT.":[159],"analysis":[161],"has":[162],"shown":[163],"that":[164],"then":[175],"approach":[180,195],"automated":[183],"induction":[184],"CB-CTT":[190],"evaluates":[193],"on":[196],"ITC":[198],"2007":[199],"second":[204],"international":[205],"competition.":[207],"evolved":[209],"performed":[211],"better":[212],"than":[213],"heuristics,":[217],"producing":[218],"timetables":[219],"with":[220],"lower":[221],"soft":[222],"constraint":[223],"costs.":[224]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}