{"id":"https://openalex.org/W4408294576","doi":"https://doi.org/10.3390/a18030158","title":"Gradual Optimization of University Course Scheduling Problem Using Genetic Algorithm and Dynamic Programming","display_name":"Gradual Optimization of University Course Scheduling Problem Using Genetic Algorithm and Dynamic Programming","publication_year":2025,"publication_date":"2025-03-10","ids":{"openalex":"https://openalex.org/W4408294576","doi":"https://doi.org/10.3390/a18030158"},"language":"en","primary_location":{"id":"doi:10.3390/a18030158","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18030158","pdf_url":"https://www.mdpi.com/1999-4893/18/3/158/pdf?version=1741605916","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/18/3/158/pdf?version=1741605916","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Xu Han","orcid":"https://orcid.org/0009-0007-1217-3530"},"institutions":[{"id":"https://openalex.org/I31683504","display_name":"Beijing Forestry University","ror":"https://ror.org/04xv2pc41","country_code":"CN","type":"education","lineage":["https://openalex.org/I1327237609","https://openalex.org/I31683504","https://openalex.org/I4210127390"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xu Han","raw_affiliation_strings":["School of Technology, Beijing Forestry University, Beijing 100083, China"],"raw_orcid":"https://orcid.org/0009-0007-1217-3530","affiliations":[{"raw_affiliation_string":"School of Technology, Beijing Forestry University, Beijing 100083, China","institution_ids":["https://openalex.org/I31683504"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054552774","display_name":"Dian Wang","orcid":"https://orcid.org/0000-0003-4447-3822"},"institutions":[{"id":"https://openalex.org/I31683504","display_name":"Beijing Forestry University","ror":"https://ror.org/04xv2pc41","country_code":"CN","type":"education","lineage":["https://openalex.org/I1327237609","https://openalex.org/I31683504","https://openalex.org/I4210127390"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Dian Wang","raw_affiliation_strings":["School of Technology, Beijing Forestry University, Beijing 100083, China"],"raw_orcid":"https://orcid.org/0000-0003-4447-3822","affiliations":[{"raw_affiliation_string":"School of Technology, Beijing Forestry University, Beijing 100083, China","institution_ids":["https://openalex.org/I31683504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054552774"],"corresponding_institution_ids":["https://openalex.org/I31683504"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1782},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1782},"fwci":11.4007,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.98351793,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"18","issue":"3","first_page":"158","last_page":"158"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998999834060669,"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.9998999834060669,"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":0.9898999929428101,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9858999848365784,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6345280408859253},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6248666644096375},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5644295811653137},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.470905065536499},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4629353880882263},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4213407039642334},{"id":"https://openalex.org/keywords/course","display_name":"Course (navigation)","score":0.41708436608314514},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4138273596763611},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21735993027687073},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.12496644258499146},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06292766332626343}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6345280408859253},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6248666644096375},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5644295811653137},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.470905065536499},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4629353880882263},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4213407039642334},{"id":"https://openalex.org/C2777552389","wikidata":"https://www.wikidata.org/wiki/Q1962728","display_name":"Course (navigation)","level":2,"score":0.41708436608314514},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4138273596763611},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21735993027687073},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.12496644258499146},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06292766332626343},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a18030158","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18030158","pdf_url":"https://www.mdpi.com/1999-4893/18/3/158/pdf?version=1741605916","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:c88ec94fc72b4de8b038cf6669f054d5","is_oa":true,"landing_page_url":"https://doaj.org/article/c88ec94fc72b4de8b038cf6669f054d5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 18, Iss 3, p 158 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a18030158","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18030158","pdf_url":"https://www.mdpi.com/1999-4893/18/3/158/pdf?version=1741605916","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4408294576.pdf"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W744492417","https://openalex.org/W1447216481","https://openalex.org/W1993342066","https://openalex.org/W2042767708","https://openalex.org/W2049469642","https://openalex.org/W2055579305","https://openalex.org/W2061344791","https://openalex.org/W2073634948","https://openalex.org/W2105599997","https://openalex.org/W2170387374","https://openalex.org/W2620577715","https://openalex.org/W2735745260","https://openalex.org/W2742286487","https://openalex.org/W2750824817","https://openalex.org/W2883037762","https://openalex.org/W2918082440","https://openalex.org/W2962959752","https://openalex.org/W3005680372","https://openalex.org/W3006275750","https://openalex.org/W3011975155","https://openalex.org/W3036220094","https://openalex.org/W3042258821","https://openalex.org/W3097265777","https://openalex.org/W3158618512","https://openalex.org/W3183828382","https://openalex.org/W3204207927","https://openalex.org/W3209694105","https://openalex.org/W4200310332","https://openalex.org/W4205534337","https://openalex.org/W4224251405","https://openalex.org/W4224909141","https://openalex.org/W4284881381","https://openalex.org/W4290058881","https://openalex.org/W4295185430","https://openalex.org/W4367856919","https://openalex.org/W4386171755","https://openalex.org/W4388835733","https://openalex.org/W4389612505","https://openalex.org/W4391116792","https://openalex.org/W4391543544","https://openalex.org/W4392504709","https://openalex.org/W4399325890","https://openalex.org/W4400081846","https://openalex.org/W6622073268"],"related_works":["https://openalex.org/W4318717247","https://openalex.org/W2267656092","https://openalex.org/W2317874921","https://openalex.org/W2736755255","https://openalex.org/W4362648715","https://openalex.org/W2009385780","https://openalex.org/W3082623308","https://openalex.org/W3120503679","https://openalex.org/W2359390960","https://openalex.org/W2238501609"],"abstract_inverted_index":{"The":[0,206],"university":[1],"course":[2,255],"scheduling":[3,52,64,213,256,266,278,306],"problem":[4,11],"(UCSP)":[5],"is":[6],"a":[7,100,104,125,132,144,190,272],"challenging":[8],"combinatorial":[9],"optimization":[10,14,204],"that":[12,209,219,242,269],"requires":[13],"of":[15,18,45,58,80,85,152,162,220,264,275],"the":[16,19,42,46,56,62,82,94,116,150,160,163,197,212,221,235,244,262,265,294,298],"quality":[17,214],"schedule":[20],"and":[21,32,88,97,107,128,201,224,247,285],"resource":[22],"utilization":[23,151,237],"while":[24],"meeting":[25],"multiple":[26],"constraints":[27,84],"involving":[28],"courses,":[29,54],"teachers,":[30],"students,":[31],"classrooms.":[33],"Although":[34],"various":[35],"algorithms":[36,296],"have":[37],"been":[38],"applied":[39],"to":[40,51,115,136,218,230,241],"solve":[41],"UCSP,":[43,299],"most":[44],"existing":[47,295],"methods":[48],"are":[49],"limited":[50],"independent":[53,89],"neglecting":[55],"impact":[57],"joint":[59,87,254],"courses":[60,90],"on":[61,124,172],"overall":[63],"results.":[65],"To":[66,92,158],"address":[67],"this":[68,70,166],"limitation,":[69],"paper":[71],"proposed":[72],"an":[73,249],"innovative":[74],"mixed-integer":[75],"linear":[76],"programming":[77],"model":[78],"capable":[79],"handling":[81],"complex":[83,308],"both":[86],"simultaneously.":[91],"improve":[93],"computational":[95],"efficiency":[96],"solution":[98],"quality,":[99],"hybrid":[101],"method":[102],"combining":[103],"genetic":[105],"algorithm":[106,146],"dynamic":[108],"programming,":[109],"named":[110],"POGA-DP,":[111],"was":[112,155],"designed.":[113],"Compared":[114],"traditional":[117,191,222,245],"algorithms,":[118,188],"POGA-DP":[119,210,233,270,292],"introduced":[120],"exchange":[121],"operations":[122,130],"based":[123],"judgment":[126],"mechanism":[127,135],"mutation":[129],"with":[131,185,243],"forced":[133],"repair":[134],"effectively":[137],"avoid":[138],"local":[139],"optima.":[140],"Additionally,":[141],"by":[142,215,228,238],"incorporating":[143],"greedy":[145],"for":[147,304],"classroom":[148,153,226,236],"allocation,":[149],"resources":[154],"further":[156],"enhanced.":[157],"verify":[159],"performance":[161,251],"new":[164],"method,":[165],"study":[167,259],"not":[168],"only":[169],"tested":[170],"it":[171,301],"real":[173],"UCSP":[174],"instances":[175],"at":[176],"Beijing":[177],"Forestry":[178],"University":[179],"but":[180],"also":[181,260],"conducted":[182],"comparative":[183],"experiments":[184],"several":[186],"classic":[187],"including":[189],"GA,":[192],"Ant":[193],"Colony":[194],"Optimization":[195],"(ACO),":[196],"Producer\u2013Scrounger":[198],"Method":[199],"(PSM),":[200],"particle":[202],"swarm":[203],"(PSO).":[205],"results":[207],"showed":[208],"improved":[211],"46.99%":[216],"compared":[217,240],"GA":[223,246],"reduced":[225],"usage":[227],"up":[229],"29.27%.":[231],"Furthermore,":[232],"increased":[234],"0.989%":[239],"demonstrated":[248],"outstanding":[250],"in":[252,277,287,297],"solving":[253],"problems.":[257],"This":[258],"analyzed":[261],"stability":[263,286],"results,":[267],"revealing":[268],"maintained":[271],"high":[273],"level":[274],"consistency":[276],"across":[279],"adjacent":[280],"weeks,":[281],"proving":[282],"its":[283],"feasibility":[284],"practical":[288],"applications.":[289],"In":[290],"conclusion,":[291],"outperformed":[293],"making":[300],"particularly":[302],"suitable":[303],"efficient":[305],"under":[307],"constraints.":[309]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":5}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}