{"id":"https://openalex.org/W68100618","doi":null,"title":"Genetic Algorithms for University Course Timetabling Problems","display_name":"Genetic Algorithms for University Course Timetabling Problems","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W68100618","mag":"68100618"},"language":"en","primary_location":{"id":"pmh:oai:figshare.com:article/10106963","doi":null,"is_oa":true,"landing_page_url":"https://figshare.com/articles/thesis/Genetic_Algorithms_for_University_Course_Timetabling_Problems/10106963","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,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"parent_works":[],"lineage":["https://openalex.org/W68100618"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/thesis/Genetic_Algorithms_for_University_Course_Timetabling_Problems/10106963","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023052971","display_name":"Sadaf Naseem Jat","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sadaf Naseem Jat","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5023052971"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9994999766349792,"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":0.9994999766349792,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":9.999999747378752e-05,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/university-course-timetabling","display_name":"university course timetabling","score":0.9940000176429749},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.9869999885559082},{"id":"https://openalex.org/keywords/local-search","display_name":"local search","score":0.7639999985694885},{"id":"https://openalex.org/keywords/guided-search","display_name":"guided search","score":0.9940000176429749},{"id":"https://openalex.org/keywords/multi-objective-evolutionary-algorithms","display_name":"multi-objective evolutionary algorithms","score":0.953000009059906},{"id":"https://openalex.org/keywords/time-slot-scheduling","display_name":"time slot scheduling","score":0.5440000295639038},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"constrained optimization","score":0.6539999842643738}],"concepts":[{"id":"https://openalex.org/C2777552389","wikidata":"https://www.wikidata.org/wiki/Q1962728","display_name":"Course (navigation)","level":2,"score":0.692026674747467},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5232174396514893},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37979233264923096},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33358442783355713},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.19656279683113098},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.06309568881988525}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:figshare.com:article/10106963","doi":null,"is_oa":true,"landing_page_url":"https://figshare.com/articles/thesis/Genetic_Algorithms_for_University_Course_Timetabling_Problems/10106963","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,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"pmh:oai:lra.le.ac.uk:2381/10997","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/2381/10997","pdf_url":null,"source":{"id":"https://openalex.org/S4306402365","display_name":"Leicester Research Archive (University of Leicester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I153648349","host_organization_name":"University of Leicester","host_organization_lineage":["https://openalex.org/I153648349"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"mag:68100618","doi":null,"is_oa":false,"landing_page_url":"https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.556295","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1026.2078","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1026.2078","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://lra.le.ac.uk/bitstream/2381/10997/1/2012NaseemJatSNPhD.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/10106963","doi":null,"is_oa":true,"landing_page_url":"https://figshare.com/articles/thesis/Genetic_Algorithms_for_University_Course_Timetabling_Problems/10106963","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,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W68100618.pdf","grobid_xml":"https://content.openalex.org/works/W68100618.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W1504943474","https://openalex.org/W2232769049"],"related_works":["https://openalex.org/W7100333533","https://openalex.org/W2154392307","https://openalex.org/W2138144419","https://openalex.org/W2007072829","https://openalex.org/W7098710573","https://openalex.org/W2184398935","https://openalex.org/W7095367028","https://openalex.org/W1609048613","https://openalex.org/W2265510423"],"abstract_inverted_index":{"The":[0],"university":[1,76,101,136,218,232,265,284,312,329],"course":[2,77,102,137,219,233,266,285,313,330],"timetabling":[3,78,103,138,220,234,267,286,314,331],"problem":[4,9,60,287],"is":[5,24,164,271],"a":[6,20,25,68,223,248,275,290,308],"difficult":[7],"optimisation":[8,225,303],"due":[10],"to":[11,46,57,96,109,130,170,205,216],"its":[12,132],"highly-constrained":[13],"nature.":[14],"Finding":[15],"an":[16,196],"optimal,":[17],"or":[18],"even":[19],"high":[21,172],"quality,":[22],"timetable":[23,156],"challenging":[26],"task,":[27],"especially":[28],"when":[29],"resources":[30],"(e.g.,":[31],"rooms":[32],"and":[33,202,246,258,327],"time":[34,152],"slots)":[35],"are":[36,83,107,123,193,203,297],"limited.":[37],"In":[38,50,178],"the":[39,59,111,126,135,146,155,176,179,183,190,207,230,238,263,282,318,321],"literature,":[40],"many":[41,143],"approaches":[42,241,323],"have":[43,63],"been":[44,64],"studied":[45],"solve":[47,58],"this":[48,51,90],"problem.":[49,139,235,268],"thesis,":[52,91],"we":[53,92,227],"investigate":[54,93],"genetic":[55,81,94,115,128,168],"algorithms":[56,82,95,116,169,245,253,280,295],"because":[61,148],"they":[62],"successfully":[65],"used":[66,299],"for":[67,75,100,134,212,262,281,300,324],"wide":[69],"range":[70],"of":[71,114,154,186,209,250,277,292,310,320],"real-world":[72],"problems.":[73,104,119,332],"However,":[74],"problems,":[79],"traditional":[80,127],"not":[84],"usually":[85],"considered":[86],"as":[87,222],"efficient":[88],"solvers.\\nIn":[89],"acquire":[97],"good":[98],"solutions":[99],"Several":[105],"ideas":[106],"introduced":[108,124,166],"increase":[110],"general":[112,301],"performance":[113,133],"on":[117,151,255,289,307],"these":[118],"Local":[120],"search":[121,162,181,257,260],"strategies":[122,261],"into":[125,167,175,242,274],"algorithm":[129],"enhance":[131],"This":[140,269],"differs":[141],"from":[142,189],"works":[144,150],"in":[145,195],"literature":[147],"it":[149],"slots":[153],"rather":[157],"than":[158],"events":[159],"directly.\\nA":[160],"guided":[161,180,259],"approach":[163],"also":[165,228],"produce":[171],"quality":[173],"individuals":[174,188,211],"population.":[177],"technique,":[182],"best":[184],"parts":[185],"selected":[187],"current":[191],"population":[192],"stored":[194],"extra":[197],"memory":[198],"(or":[199],"data":[200],"structure)":[201],"re-used":[204],"guide":[206],"generation":[208],"new":[210],"subsequent":[213],"populations.\\nIn":[214],"addition":[215],"solving":[217],"problems":[221],"single-objective":[224],"problem,":[226],"tackle":[229],"multi-objective":[231,243,251,264,278,283,293,302,328],"We":[236],"integrate":[237],"above":[239],"proposed":[240,322],"evolutionary":[244,252,279,294],"propose":[247],"framework":[249,270],"based":[254,288,306],"local":[256],"then":[272],"instantiated":[273],"set":[276,291,309],"that":[296],"typically":[298],"problems.\\nComputational":[304],"results":[305],"well-known":[311],"benchmark":[315],"instances,":[316],"show":[317],"effectiveness":[319],"both":[325],"single-":[326]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-11-15T12:55:33.944570","created_date":"2016-06-24T00:00:00"}