{"id":"https://openalex.org/W3015815757","doi":"https://doi.org/10.1109/kst48564.2020.9059349","title":"An Outperforming Hybrid Discrete Particle Swarm Optimization for Solving the Timetabling Problem","display_name":"An Outperforming Hybrid Discrete Particle Swarm Optimization for Solving the Timetabling Problem","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3015815757","doi":"https://doi.org/10.1109/kst48564.2020.9059349","mag":"3015815757"},"language":"en","primary_location":{"id":"doi:10.1109/kst48564.2020.9059349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/kst48564.2020.9059349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 12th International Conference on Knowledge and Smart Technology (KST)","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/A5019190395","display_name":"Unprasertporn Thanawat","orcid":null},"institutions":[{"id":"https://openalex.org/I82828225","display_name":"King Mongkut's University of Technology North Bangkok","ror":"https://ror.org/04fy6jb97","country_code":"TH","type":"education","lineage":["https://openalex.org/I82828225"]}],"countries":["TH"],"is_corresponding":true,"raw_author_name":"Thanawat Unprasertporn","raw_affiliation_strings":["Department of Mathematics, Faculty of Applied Science, King Mongkut's University of Technology North Bangkok, Bangkok, Thailand"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Faculty of Applied Science, King Mongkut's University of Technology North Bangkok, Bangkok, Thailand","institution_ids":["https://openalex.org/I82828225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018603494","display_name":"Dome Lohpetch","orcid":null},"institutions":[{"id":"https://openalex.org/I82828225","display_name":"King Mongkut's University of Technology North Bangkok","ror":"https://ror.org/04fy6jb97","country_code":"TH","type":"education","lineage":["https://openalex.org/I82828225"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Dome Lohpetch","raw_affiliation_strings":["Department of Mathematics, Faculty of Applied Science, King Mongkut's University of Technology North Bangkok, Bangkok, Thailand"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Faculty of Applied Science, King Mongkut's University of Technology North Bangkok, Bangkok, Thailand","institution_ids":["https://openalex.org/I82828225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019190395"],"corresponding_institution_ids":["https://openalex.org/I82828225"],"apc_list":null,"apc_paid":null,"fwci":0.7181,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.73752525,"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":"18","last_page":"23"},"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.9664999842643738,"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/T14025","display_name":"Educational Technology and Assessment","score":0.9329000115394592,"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/tabu-search","display_name":"Tabu search","score":0.7756499648094177},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7015451788902283},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6411663293838501},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.6026589274406433},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5968650579452515},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5377386212348938},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5309735536575317},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.4619174003601074},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4348345994949341},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.41864585876464844},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3302610516548157},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2773250341415405},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.09329628944396973}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.7756499648094177},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7015451788902283},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6411663293838501},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.6026589274406433},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5968650579452515},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5377386212348938},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5309735536575317},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4619174003601074},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4348345994949341},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.41864585876464844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3302610516548157},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2773250341415405},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.09329628944396973},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/kst48564.2020.9059349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/kst48564.2020.9059349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 12th International Conference on Knowledge and Smart Technology (KST)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W92177461","https://openalex.org/W1435381774","https://openalex.org/W1490782680","https://openalex.org/W1512847430","https://openalex.org/W1526848900","https://openalex.org/W1532406186","https://openalex.org/W1973555220","https://openalex.org/W1975473038","https://openalex.org/W2000541569","https://openalex.org/W2003160050","https://openalex.org/W2006146932","https://openalex.org/W2033930346","https://openalex.org/W2056956492","https://openalex.org/W2058309795","https://openalex.org/W2060916759","https://openalex.org/W2086726443","https://openalex.org/W2092856865","https://openalex.org/W2099942580","https://openalex.org/W2112311907","https://openalex.org/W2113836425","https://openalex.org/W2138144419","https://openalex.org/W2152512538","https://openalex.org/W2292400554","https://openalex.org/W6603772283"],"related_works":["https://openalex.org/W2052469048","https://openalex.org/W4321504838","https://openalex.org/W2081475278","https://openalex.org/W2794855054","https://openalex.org/W2005169299","https://openalex.org/W150166259","https://openalex.org/W2606087467","https://openalex.org/W1540477665","https://openalex.org/W2314520391","https://openalex.org/W2519041592"],"abstract_inverted_index":{"There":[0],"are":[1],"various":[2],"categories":[3],"of":[4,10,53,63,119,126,138],"the":[5,17,51,54,61,64,117,124,136,152,172,175,180,192,201],"timetabling":[6,22],"problem,":[7,36],"and":[8,32,77,111,174,194],"one":[9],"them":[11],"that":[12,41,70,179],"is":[13,16,27,38,66],"quite":[14],"interesting":[15],"post":[18],"enrolment":[19],"based":[20],"course":[21],"problem":[23,65,165],"(PECTP).":[24],"The":[25,155],"PETCP":[26],"classified":[28],"as":[29,80,82],"an":[30,67],"NP-complete":[31],"a":[33,93,139,162],"combinatorial":[34],"optimization":[35],"which":[37],"well":[39],"known":[40],"no":[42],"algorithm":[43,100],"to":[44,57,72,115,141,186],"solve":[45],"it":[46,195],"by":[47,122],"spending":[48],"time":[49],"in":[50,144,147,166],"degree":[52],"polynomial":[55],"due":[56],"its":[58,85],"complexity.":[59],"Furthermore,":[60],"solution":[62,121,140],"optimal":[68],"timetable":[69],"has":[71],"satisfy":[73],"all":[74,198],"hard":[75],"constraints":[76,79],"soft":[78],"much":[81],"possible":[83],"reflecting":[84],"quality.":[86],"In":[87,130],"this":[88],"paper,":[89],"we":[90,132],"have":[91,134],"developed":[92],"Hybrid":[94],"Genetic-based":[95],"Discrete":[96],"Particle":[97],"Swarm":[98],"Optimization":[99],"hybridizing":[101],"with":[102,168],"two":[103],"different":[104],"local":[105],"search":[106],"algorithms":[107,199],"including":[108],"Local":[109],"Search":[110,113],"Tabu":[112],"(HGDPSOLTS)":[114],"improve":[116],"performance":[118,149],"searching":[120],"using":[123],"advantage":[125],"their":[127],"exploitation":[128],"abilities.":[129],"addition,":[131],"also":[133],"improved":[135],"representation":[137],"reduce":[142],"complexity":[143],"computation,":[145],"resulting":[146],"improving":[148],"for":[150,190],"solving":[151,191],"discrete":[153],"function":[154],"proposed":[156,181],"hybrid":[157,182],"approach":[158,183],"was":[159,184],"tested":[160],"on":[161],"standard":[163],"benchmark":[164],"comparison":[167],"other":[169],"approaches":[170],"from":[171,200],"literature":[173],"experimental":[176],"results":[177],"indicated":[178],"able":[185],"find":[187],"effective":[188],"solutions":[189],"PECTP,":[193],"can":[196],"outperform":[197],"literature.":[202]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}