{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T05:54:25Z","timestamp":1770270865134,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T00:00:00Z","timestamp":1620432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T00:00:00Z","timestamp":1620432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100017170","name":"Thailand Science Research and Innovation","doi-asserted-by":"crossref","award":["MRG6080066"],"award-info":[{"award-number":["MRG6080066"]}],"id":[{"id":"10.13039\/501100017170","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100012527","name":"Office of the Higher Education Commission","doi-asserted-by":"publisher","award":["MRG6080066"],"award-info":[{"award-number":["MRG6080066"]}],"id":[{"id":"10.13039\/100012527","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s42979-021-00652-2","type":"journal-article","created":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T15:02:27Z","timestamp":1620486147000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Particle Swarm Optimisation Variants and Its Hybridisation Ratios for Generating Cost-Effective Educational Course Timetables"],"prefix":"10.1007","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7127-0310","authenticated-orcid":false,"given":"Thatchai","family":"Thepphakorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2166-9374","authenticated-orcid":false,"given":"Saisumpan","family":"Sooncharoen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8059-8852","authenticated-orcid":false,"given":"Pupong","family":"Pongcharoen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,8]]},"reference":[{"key":"652_CR1","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1016\/S1470-2045(20)30287-4","volume":"21","author":"TK Burki","year":"2020","unstructured":"Burki TK. COVID-19: consequences for higher education. Lancet Oncol. 2020;21:758.","journal-title":"Lancet Oncol"},{"key":"652_CR2","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-030-51968-1_28","volume":"12218","author":"T Thepphakorn","year":"2020","unstructured":"Thepphakorn T, Sooncharoen S, Pongcharoen P. Academic operating costs optimisation using hybrid MCPSO based course timetabling tool. Lect Notes Comput Sci. 2020;12218:338\u201350.","journal-title":"Lect Notes Comput Sci"},{"key":"652_CR3","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1016\/j.ijpe.2007.07.009","volume":"112","author":"P Pongcharoen","year":"2008","unstructured":"Pongcharoen P, Promtet W, Yenradee P, Hicks C. Stochastic optimisation timetabling tool for university course scheduling. Int J Prod Econ. 2008;112:903\u201318.","journal-title":"Int J Prod Econ"},{"key":"652_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.ijpe.2013.04.026","volume":"149","author":"T Thepphakorn","year":"2014","unstructured":"Thepphakorn T, Pongcharoen P, Hicks C. An ant colony based timetabling tool. Int J Prod Econ. 2014;149:131\u201344.","journal-title":"Int J Prod Econ"},{"key":"652_CR5","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.ijpe.2016.03.019","volume":"190","author":"S Vitayasak","year":"2017","unstructured":"Vitayasak S, Pongcharoen P, Hicks C. A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a Genetic Algorithm or modified Backtracking Search Algorithm. Int J Prod Econ. 2017;190:146\u201357.","journal-title":"Int J Prod Econ"},{"key":"652_CR6","first-page":"59","volume-title":"Lecture Notes in computer science","author":"K Dapa","year":"2013","unstructured":"Dapa K, Loreungthup P, Vitayasak S, Pongcharoen P. Bat algorithm, genetic algorithm and shuffled frog leaping algorithm for designing machine layout. In: Ramanna S, Lingras P, Sombattheera C, Krishna A, editors. Lecture Notes in computer science. Berlin: Springer; 2013. p. 59\u201368."},{"key":"652_CR7","first-page":"220","volume-title":"Lecture notes in computer science","author":"P Pongcharoen","year":"2008","unstructured":"Pongcharoen P, Chainate W, Pongcharoen S. Improving artificial immune system performance: inductive bias and alternative mutations. In: Bentley PJ, Lee D, Jung S, editors. Lecture notes in computer science. Berlin: Springer; 2008. p. 220\u201331."},{"key":"652_CR8","doi-asserted-by":"publisher","first-page":"106480","DOI":"10.1016\/j.asoc.2020.106480","volume":"94","author":"S Sooncharoen","year":"2020","unstructured":"Sooncharoen S, Pongcharoen P, Hicks C. Grey wolf production scheduling for the capital goods industry. Appl Soft Comput. 2020;94:106480.","journal-title":"Appl Soft Comput"},{"key":"652_CR9","doi-asserted-by":"publisher","first-page":"6705","DOI":"10.1080\/00207543.2018.1471240","volume":"57","author":"S Chansombat","year":"2019","unstructured":"Chansombat S, Musikapun P, Pongcharoen P, Hicks C. A hybrid discrete bat algorithm with Krill Herd-based advanced planning and scheduling tool for the capital goods industry. Int J Prod Res. 2019;57:6705\u201326.","journal-title":"Int J Prod Res"},{"key":"652_CR10","doi-asserted-by":"publisher","first-page":"113224","DOI":"10.1016\/j.eswa.2020.113224","volume":"148","author":"I Dahmani","year":"2020","unstructured":"Dahmani I, Hifi M, Saadi T, Yousef L. A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict graphs. Expert Syst Appl. 2020;148:113224.","journal-title":"Expert Syst Appl"},{"key":"652_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s12065-013-0102-2","volume":"7","author":"X-S Yang","year":"2014","unstructured":"Yang X-S. Swarm Intelligence Based Algorithms: A Critical Analysis. Evol Intel. 2014;7:17\u201328.","journal-title":"Evol Intel"},{"key":"652_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00291-007-0097-0","volume":"30","author":"R Lewis","year":"2008","unstructured":"Lewis R. A survey of metaheuristic-based techniques for University Timetabling problems. OR Spectr. 2008;30:167\u201390.","journal-title":"OR Spectr"},{"key":"652_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10462-010-9191-9","volume":"35","author":"S Rana","year":"2011","unstructured":"Rana S, Jasola S, Kumar R. A review on particle swarm optimization algorithms and their applications to data clustering. Artif Intell Rev. 2011;35:211\u201322.","journal-title":"Artif Intell Rev"},{"key":"652_CR14","doi-asserted-by":"crossref","unstructured":"Irene SFH, Deris S, Mohd HSZ. A combination of PSO and local search in university course timetabling problem. In: Proceedings 2009 International Conference on Computer Engineering and Technology, ICCET 2009, 2009, pp. 492\u20135.","DOI":"10.1109\/ICCET.2009.188"},{"key":"652_CR15","first-page":"128","volume":"12","author":"MA Ahandani","year":"2013","unstructured":"Ahandani MA, Vakil Baghmisheh MT. Hybridizing genetic algorithms and particle swarm optimization transplanted into a hyper-heuristic system for solving university course timetabling problem. WSEAS Trans Comput. 2013;12:128\u201343.","journal-title":"WSEAS Trans Comput"},{"key":"652_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.3390\/a6020227","volume":"6","author":"RM Chen","year":"2013","unstructured":"Chen RM, Shih HF. Solving university course timetabling problems using constriction particle swarm optimization with local search. Algorithms. 2013;6:227\u201344.","journal-title":"Algorithms"},{"key":"652_CR17","doi-asserted-by":"crossref","unstructured":"Oswald C, Anand DDC. Novel hybrid PSO algorithms with search optimization strategies for a University Course Timetabling Problem. In: Proceedings of the 5th International Conference on Advanced Computing, ICoAC 2013, 2014, pp. 77\u201385.","DOI":"10.1109\/ICoAC.2013.6921931"},{"key":"652_CR18","doi-asserted-by":"publisher","first-page":"113732","DOI":"10.1016\/j.eswa.2020.113732","volume":"161","author":"T Thepphakorn","year":"2020","unstructured":"Thepphakorn T, Pongcharoen P. Performance improvement strategies on Cuckoo Search algorithms for solving the university course timetabling problem. Expert Syst Appl. 2020;161:113732.","journal-title":"Expert Syst Appl"},{"key":"652_CR19","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11750-015-0366-z","volume":"23","author":"A Bettinelli","year":"2015","unstructured":"Bettinelli A, Cacchiani V, Roberti R, Toth P. An overview of curriculum-based course timetabling. TOP. 2015;23:313\u201349.","journal-title":"TOP"},{"key":"652_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10951-018-0558-0","volume":"22","author":"XM Xu","year":"2019","unstructured":"Xu XM, Li KP, Yang LX, Gao ZY. An efficient train scheduling algorithm on a single-track railway system. J Sched. 2019;22:85\u2013105.","journal-title":"J Sched"},{"key":"652_CR21","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.cor.2015.12.016","volume":"70","author":"T Januario","year":"2016","unstructured":"Januario T, Urrutia S. A new neighborhood structure for round robin scheduling problems. Comput Oper Res. 2016;70:127\u201339.","journal-title":"Comput Oper Res"},{"key":"652_CR22","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.ejor.2018.09.027","volume":"285","author":"A Legrain","year":"2020","unstructured":"Legrain A, Omer J, Rosat S. An online stochastic algorithm for a dynamic nurse scheduling problem. Eur J Oper Res. 2020;285:196\u2013210.","journal-title":"Eur J Oper Res"},{"key":"652_CR23","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/j.ejor.2015.04.008","volume":"245","author":"TAO Silva","year":"2015","unstructured":"Silva TAO, de Souza MC, Saldanha RR, Burke EK. Surgical scheduling with simultaneous employment of specialised human resources. Eur J Oper Res. 2015;245:719\u201330.","journal-title":"Eur J Oper Res"},{"key":"652_CR24","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10951-020-00654-7","volume":"23","author":"FT De Komarudin","year":"2020","unstructured":"De Komarudin FT, Guerry M-A, Vanden BG. The extended roster quality staffing problem: addressing roster quality variation within a staffing planning period. J Sched. 2020;23:253\u201364.","journal-title":"J Sched"},{"key":"652_CR25","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10951-014-0403-z","volume":"18","author":"L Muggy","year":"2015","unstructured":"Muggy L, Easton T. Generating class schedules within a complex modular environment with application to secondary schools. J Sched. 2015;18:369\u201376.","journal-title":"J Sched"},{"key":"652_CR26","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10489-020-01833-x","volume":"51","author":"A Rezaeipanah","year":"2020","unstructured":"Rezaeipanah A, Matoori SS, Ahmadi G. A hybrid algorithm for the university course timetabling problem using the improved parallel genetic algorithm and local search. Appl Intell. 2020;51:467\u201392.","journal-title":"Appl Intell"},{"key":"652_CR27","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.cie.2014.11.010","volume":"86","author":"H Babaei","year":"2015","unstructured":"Babaei H, Karimpour J, Hadidi A. A survey of approaches for university course timetabling problem. Comput Ind Eng. 2015;86:43\u201359.","journal-title":"Comput Ind Eng"},{"key":"652_CR28","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/841748","author":"T Thepphakorn","year":"2015","unstructured":"Thepphakorn T, Pongcharoen P, Hicks C. Modifying regeneration mutation and hybridising clonal selection for evolutionary algorithms based timetabling tool. Math Probl Eng. 2015. https:\/\/doi.org\/10.1155\/2015\/841748.","journal-title":"Math Probl Eng"},{"key":"652_CR29","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-030-26369-0_17","volume":"11655","author":"T Thepphakorn","year":"2019","unstructured":"Thepphakorn T, Pongcharoen P. Variants and parameters investigations of particle swarm optimisation for solving course timetabling problems. Lect Notes Comput Sci. 2019;11655:177\u201387.","journal-title":"Lect Notes Comput Sci"},{"key":"652_CR30","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R. Particle swarm optimization. In: IEEE International Conference on Neural Networks, 1995, pp. 1942\u20138.","DOI":"10.1109\/ICNN.1995.488968"},{"key":"652_CR31","volume-title":"Nature-inspired optimization algorithms","author":"X-S Yang","year":"2014","unstructured":"Yang X-S. Nature-inspired optimization algorithms. Amsterdam: Elsevier; 2014."},{"key":"652_CR32","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/931256","author":"Y Zhang","year":"2015","unstructured":"Zhang Y, Wang S, Ji G. A comprehensive survey on particle swarm optimization algorithm and its applications. Math Probl Eng. 2015. https:\/\/doi.org\/10.1155\/2015\/931256.","journal-title":"Math Probl Eng"},{"key":"652_CR33","first-page":"5208","volume":"217","author":"R Thangaraj","year":"2011","unstructured":"Thangaraj R, Pant M, Abraham A, Bouvry P. Particle swarm optimization: Hybridization perspectives and experimental illustrations. Appl Math Comput. 2011;217:5208\u201326.","journal-title":"Appl Math Comput"},{"key":"652_CR34","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1016\/j.asoc.2016.06.028","volume":"47","author":"R Vafashoar","year":"2016","unstructured":"Vafashoar R, Meybodi MR. Multi swarm bare bones particle swarm optimization with distribution adaption. Appl Soft Comput. 2016;47:534\u201352.","journal-title":"Appl Soft Comput"},{"key":"652_CR35","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1109\/TEVC.2015.2411741","volume":"19","author":"CW Fong","year":"2015","unstructured":"Fong CW, Asmuni H, McCollum B. A hybrid swarm-based approach to university timetabling. IEEE Trans Evol Comput. 2015;19:870\u201384.","journal-title":"IEEE Trans Evol Comput"},{"key":"652_CR36","doi-asserted-by":"crossref","unstructured":"Irene HSF, Safaai D, Mohd H, Zaiton S. University course timetable planning using hybrid particle swarm optimization. In: Proceedings of the 1st ACM\/SIGEVO Summit on Genetic and Evolutionary Computation, GEC'09, 2009, pp. 239\u201345.","DOI":"10.1145\/1543834.1543868"},{"key":"652_CR37","doi-asserted-by":"publisher","DOI":"10.1109\/ICACC.2009.112","author":"FHI Sheau","year":"2009","unstructured":"Sheau FHI, Safaai D, Siti ZMH. A study on PSO-based university course timetabling problem. Int Conf Asv Comput Control. 2009. https:\/\/doi.org\/10.1109\/ICACC.2009.112.","journal-title":"Int Conf Asv Comput Control"},{"key":"652_CR38","first-page":"256","volume-title":"Particle swarm optimization with transition probability for timetabling problems","author":"H Kanoh","year":"2013","unstructured":"Kanoh H, Chen S. Particle swarm optimization with transition probability for timetabling problems. Berlin: Springer; 2013. p. 256\u201365."},{"key":"652_CR39","first-page":"113","volume":"5","author":"T Thepphakorn","year":"2013","unstructured":"Thepphakorn T, Pongcharoen P. Heuristic ordering for ant colony based timetabling tool. J Appl Oper Res. 2013;5:113\u201323.","journal-title":"J Appl Oper Res"},{"key":"652_CR40","first-page":"49","volume":"8","author":"A Khadwilard","year":"2012","unstructured":"Khadwilard A, Chansombat S, Thepphakorn T, Thapatsuwan P, Chainate W, Pongcharoen P. Application of firefly algorithm and its parameter setting for job shop scheduling. J Ind Technol. 2012;8:49\u201358.","journal-title":"J Ind Technol"},{"key":"652_CR41","first-page":"196","volume-title":"A new multiple objective cuckoo search for university course timetabling problem. Lecture notes in computer science 10053 LNAI","author":"T Thepphakorn","year":"2016","unstructured":"Thepphakorn T, Pongcharoen P, Vitayasak S. A new multiple objective cuckoo search for university course timetabling problem. Lecture notes in computer science 10053 LNAI. Cham: Springer; 2016. p. 196\u2013207."}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00652-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-021-00652-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00652-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T07:57:38Z","timestamp":1744185458000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-021-00652-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,8]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["652"],"URL":"https:\/\/doi.org\/10.1007\/s42979-021-00652-2","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"value":"2662-995X","type":"print"},{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,8]]},"assertion":[{"value":"19 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there are no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}],"article-number":"264"}}