{"id":"https://openalex.org/W2112311907","doi":"https://doi.org/10.3390/a6020227","title":"Solving University Course Timetabling Problems Using Constriction Particle Swarm Optimization with Local Search","display_name":"Solving University Course Timetabling Problems Using Constriction Particle Swarm Optimization with Local Search","publication_year":2013,"publication_date":"2013-04-19","ids":{"openalex":"https://openalex.org/W2112311907","doi":"https://doi.org/10.3390/a6020227","mag":"2112311907"},"language":"en","primary_location":{"id":"doi:10.3390/a6020227","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6020227","pdf_url":"https://www.mdpi.com/1999-4893/6/2/227/pdf?version=1372057829","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/6/2/227/pdf?version=1372057829","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050234405","display_name":"Ruey\u2010Maw Chen","orcid":"https://orcid.org/0000-0003-0738-6340"},"institutions":[{"id":"https://openalex.org/I65446980","display_name":"National Chin-Yi University of Technology","ror":"https://ror.org/040bs6h16","country_code":"TW","type":"education","lineage":["https://openalex.org/I65446980"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Ruey-Maw Chen","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Chinyi University of Technology, Taichung, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chinyi University of Technology, Taichung, Taiwan","institution_ids":["https://openalex.org/I65446980"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041029391","display_name":"Hsiao-Fang Shih","orcid":"https://orcid.org/0000-0002-2259-452X"},"institutions":[{"id":"https://openalex.org/I65446980","display_name":"National Chin-Yi University of Technology","ror":"https://ror.org/040bs6h16","country_code":"TW","type":"education","lineage":["https://openalex.org/I65446980"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Hsiao-Fang Shih","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Chinyi University of Technology, Taichung, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chinyi University of Technology, Taichung, Taiwan","institution_ids":["https://openalex.org/I65446980"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050234405"],"corresponding_institution_ids":["https://openalex.org/I65446980"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":8.5315,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.97711534,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"6","issue":"2","first_page":"227","last_page":"244"},"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/T11902","display_name":"Intelligent Tutoring Systems and Adaptive Learning","score":0.9646999835968018,"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"}},{"id":"https://openalex.org/T14025","display_name":"Educational Technology and Assessment","score":0.954800009727478,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.7035281658172607},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6901454329490662},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6644903421401978},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5322717428207397},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.51747727394104},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.516291081905365},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.46805092692375183},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.44010359048843384},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4378664493560791},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4213918447494507},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2296828031539917},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20159146189689636}],"concepts":[{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.7035281658172607},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6901454329490662},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6644903421401978},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5322717428207397},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.51747727394104},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.516291081905365},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.46805092692375183},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.44010359048843384},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4378664493560791},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4213918447494507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2296828031539917},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20159146189689636},{"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.3390/a6020227","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6020227","pdf_url":"https://www.mdpi.com/1999-4893/6/2/227/pdf?version=1372057829","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:CiteSeerX.psu:10.1.1.302.4351","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.302.4351","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mdpi.com/1999-4893/6/2/227/pdf/","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.367.9289","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.9289","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mdpi.com/1999-4893/6/2/227/pdf?y=1","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:e93a17a5c9a34d859d4c73bfeadb7224","is_oa":true,"landing_page_url":"https://doaj.org/article/e93a17a5c9a34d859d4c73bfeadb7224","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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 6, Iss 2, Pp 227-244 (2013)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/6/2/227/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a6020227","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"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":"Algorithms; Volume 6; Issue 2; Pages: 227-244","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a6020227","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6020227","pdf_url":"https://www.mdpi.com/1999-4893/6/2/227/pdf?version=1372057829","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":[{"score":0.7699999809265137,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321040","display_name":"National Science Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2112311907.pdf","grobid_xml":"https://content.openalex.org/works/W2112311907.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1875348914","https://openalex.org/W1907706552","https://openalex.org/W1975568929","https://openalex.org/W1977591801","https://openalex.org/W1996814304","https://openalex.org/W2000541569","https://openalex.org/W2006146932","https://openalex.org/W2012929820","https://openalex.org/W2034027189","https://openalex.org/W2048957381","https://openalex.org/W2055579305","https://openalex.org/W2060366173","https://openalex.org/W2087577248","https://openalex.org/W2095074627","https://openalex.org/W2101097701","https://openalex.org/W2127147933","https://openalex.org/W2138144419","https://openalex.org/W2139386984","https://openalex.org/W2144149212","https://openalex.org/W2147440785","https://openalex.org/W2147861895","https://openalex.org/W2165299997","https://openalex.org/W2165921030","https://openalex.org/W2167791430","https://openalex.org/W2169245194","https://openalex.org/W2265080090","https://openalex.org/W2402846924","https://openalex.org/W2543580944","https://openalex.org/W3133967722","https://openalex.org/W6682642761","https://openalex.org/W6684237752"],"related_works":["https://openalex.org/W3019402777","https://openalex.org/W4386596916","https://openalex.org/W3212544526","https://openalex.org/W2031835531","https://openalex.org/W2388590088","https://openalex.org/W1969166468","https://openalex.org/W2195904091","https://openalex.org/W2022727000","https://openalex.org/W2122371747","https://openalex.org/W2069224524"],"abstract_inverted_index":{"Course":[0,16],"timetabling":[1,17,28,101],"is":[2,71,176],"a":[3,72,111,116,158],"combinatorial":[4],"optimization":[5,69],"problem":[6,29],"and":[7,38,87,131,189],"has":[8,160],"been":[9,161],"confirmed":[10],"to":[11,47,61,80,89,142,148,178,192],"be":[12,48],"an":[13,137],"NP-complete":[14,77],"problem.":[15],"problems":[18,78,102],"are":[19,155],"different":[20,22],"for":[21,75],"universities.":[23],"The":[24],"studied":[25],"university":[26],"course":[27,100,181],"involves":[30],"hard":[31],"constraints":[32,44],"such":[33],"as":[34,119],"classroom,":[35],"class":[36,55],"curriculum,":[37],"other":[39],"variables.":[40],"Concurrently,":[41],"some":[42],"soft":[43],"need":[45],"also":[46],"considered,":[49],"including":[50],"teacher\u2019s":[51],"preferred":[52],"time,":[53],"favorite":[54],"time":[56],"etc.":[57],"These":[58],"preferences":[59],"correspond":[60],"satisfaction":[62],"values":[63],"obtained":[64],"via":[65],"questionnaires.":[66],"Particle":[67],"swarm":[68],"(PSO)":[70],"promising":[73],"scheme":[74,169],"solving":[76,99],"due":[79],"its":[81],"fast":[82],"convergence,":[83],"fewer":[84],"parameter":[85],"settings":[86],"ability":[88],"fit":[90],"dynamic":[91],"environmental":[92],"characteristics.":[93],"Therefore,":[94],"PSO":[95,172],"was":[96,113,140],"applied":[97,195],"towards":[98],"in":[103,115],"this":[104],"work.":[105],"To":[106],"reduce":[107],"the":[108,120,127,144,167,185,193],"computational":[109],"complexity,":[110],"timeslot":[112],"designated":[114],"particle\u2019s":[117],"encoding":[118],"scheduling":[121],"unit.":[122],"Two":[123],"types":[124],"of":[125,170,187],"PSO,":[126],"inertia":[128],"weight":[129],"version":[130],"constriction":[132,171],"version,":[133],"were":[134],"evaluated.":[135],"Moreover,":[136],"interchange":[138,174],"heuristic":[139,175],"utilized":[141],"explore":[143],"neighboring":[145],"solution":[146,150,159],"space":[147],"improve":[149],"quality.":[151],"Additionally,":[152],"schedule":[153],"conflicts":[154],"handled":[156],"after":[157],"generated.":[162],"Experimental":[163],"results":[164],"demonstrate":[165],"that":[166,183],"proposed":[168],"with":[173],"able":[177],"generate":[179],"satisfactory":[180],"timetables":[182],"meet":[184],"requirements":[186],"teachers":[188],"classes":[190],"according":[191],"various":[194],"constraints.":[196]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}