An outclassing Multi-objective Hybrid Genetic-based Discrete PSO for Solving the PECT Problem

e9e60a20-e2b1-4cf7-b1e6-2afbd12e202c20250115092608854wseas:wseasmdt@crossref.orgMDT DepositWSEAS TRANSACTIONS ON SYSTEMS AND CONTROL2224-28561991-876310.37394/23203http://wseas.org/wseas/cms.action?id=4073117202411720241910.37394/23203.2024.19https://wseas.com/journals/sac/2024.phpAn outclassing Multi-objective Hybrid Genetic-based Discrete PSO for Solving the PECT ProblemDomeLohpetchDepartment of Mathematics, Faculty of Applied Science, King Mongkut’s University of Technology North Bangkok, 1518 Pracharat 1 Road, Wongsawang, Bangsue, Bangkok 10800, THAILANDThe Post Enrolment based Course Timetabling (PECT) Problem belongs to, one of the classical problems, the timetabling problems, and it is a part of the most real-life problems that come with multiple constraints of nature. Such a problem is investigated together with both hard and soft constraints, and the solution is an optimal timetable satisfying both constraints as far as possible which reflects the quality of the solution. As a result, there are many approaches to solving the PECT Problem. However most approaches rely upon both the determination of parameters or understanding of domain knowledge. In this research, the Genetic-based Discrete Particle Swarm Optimization (PSO) has been developed with two different local search approaches: Local Search and Tabu Search to solve multi-objective functions and get good solutions by improving the performance of searching solution, which has few parameters to be tuned, and it can outperform all related algorithms from the published work.123020241230202438539242https://wseas.com/journals/sac/2024/a825103-1273.pdf10.37394/23203.2024.19.42https://wseas.com/journals/sac/2024/a825103-1273.pdf10.1137/0205048S. Even, A. Itai and A. Shamir, On the complexity of time table and multicommodity flow problems, SIAM Journal on Computing, Vol.5, No.4, 1976, pp. 691-703, doi: 10.1137/0205048. A. Schaerf, A survey of automated timetabling, Artificial intelligence review, Vol.13, No.2, 1999, pp. 87-127, doi: 10.1023/A: 1006576209967. 10.1109/kst48564.2020.9059349U. Thanawat and L. Dome, An Outperforming Hybrid Discrete Particle Swarm Optimization for Solving the Timetabling Problem, Proceedings of 12th International Conference on Knowledge and Smart Technology (KST2020), Pattaya, Thailand, 2020, pp. 18- 23, doi: 10.1109/KST48564.2020.9059349. 10.1007/978-3-319-40415-8_19J. Sawaphat and L. Dome, A Hybrid Multiobjective Genetic Algorithm with a New Local Search Approach for Solving the Post Enrolment Based Course Timetabling Problem, Proceedings of the 12th International Conference on Computing and Information Technology (IC2IT2016), Khon Kaen, Thailand, 2016, pp. 195-206, doi: 10.1007/978-3-319-40415-8. K. Socha, J. Knowles and M. Sampels, Ant algorithms, Springer Berlin Heidelberg, 2002, doi: 10.1007/3-540-45724-0_1. 10.1016/j.parco.2017.01.002V. Amandeep and K. Sakshi, A hybrid multiobjective Particle Swarm Optimization for scientific workflow scheduling, Parallel Computing, Vol.62, No.C, 2017, pp. 1–19, doi: 10.1016/j.parco.2017.01.002. 10.1007/3-540-45356-3_83K. Deb, S. Agrawal, A. Pratap and T. Meyarivan, Parallel Problem Solving from Nature PPSN VI, Springer Berlin Heidelberg, 2000, doi: 10.1007/3-540-45356-3_83. 10.1109/cec.2010.5586227S. Abdullah, H. Turabieh, B. McCollum and P. McMullan, A multi-objective post enrolment course timetabling problems, a new case study, Proceedings of the IEEE Congress on Evolutionary Computation (CEC2010), Barcelona, Spain, 2010, pp. 1-7, doi: 10.1109/CEC.2010.5586227. S.N. Jat and S. Yang, Evolutionary Computation in Combinatorial Optimization, Springer Berlin Heidelberg, 2011, doi: 10.1007/978-3-642-20364-0_1. 10.1109/iciteed.2015.7408907J. Sawaphat and L. Dome, A Hybrid Genetic Algorithm with Local Search and Tabu Search Approaches for Solving the Post Enrolment Based Course Timetabling Problem: Outperforming Guided Search Genetic Algorithm, Proceedings of the 7th International Conference on Information Technology and Electrical Engineering (ICITEE2015), Chiang Mai, Thailand, 2015, pp. 29-34, doi: 10.1109/ICITEED.2015.7408907. 10.1007/s10479-010-0769-zM. A. Al-Betar and A. T. Khader, A harmony search algorithm for university course timetabling, Annals of Operations Research, Vol.194, No.1, 2012, pp. 3-31, doi: 10.1007/s10479-010-0769-z. S. N. Jat and S. Yang, A guided search genetic algorithm for the university course timetabling problem, Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), Dublin, Ireland, 2009, pp. 180-191. 10.1057/jors.2008.102R. Qu and E. K. Burke, Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems, Journal of the Operational Research Society, Vol.60, No.9, 2009, pp. 1273-1285, doi: 10.1057/jors. 2008.102. 10.1109/ictai.2008.126S. N. Jat and S. Yang, A Memetic Algorithm for the University Course Timetabling Problem, Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI2008), Dayton, OH, USA, 2008, pp. 427-433, doi: 10.1109/ICTAI.2008.126. 10.1109/iccit.2008.379S. Abdullah and H. Turabieh, Generating university course timetable using genetic algorithms and local search, Proceedings of the 3rd International Conference on Convergence and Hybrid Information Technology (ICCIT2008), Busan, Korea (South), 2008, pp. 254-260, doi: 10.1109/ICCIT.2008.379. 10.1109/cec.2007.4424686S. Abdullah, E. K. Burke, and B. McCollum, A hybrid evolutionary approach to the university course timetabling problem, Proceedings of the IEEE Congress on Evolutionary Computation (CEC2007), Singapore, Singapore, 2007, pp. 1764-1768, doi: 10.1109/CEC.2007.4424686. 10.1016/j.ejor.2005.08.012E. K. Burke, B. McCollum, A. Meisels, S. Petrovic, and R. Qu, A graph-based hyperheuristic for educational timetabling problems, European Journal of Operational Research, Vol.176, No.1, 2007, pp. 177-192, doi: 10.1016/j.ejor.2005.08.012. S. Abdullah, E. K. Burke, and B. McCollum, Metaheuristics: Progress in Complex Systems Optimization, Springer US, 2007, doi: 10.1007/978-0-387-71921-4_8. S. Abdullah, E. K. Burke, and B. Mccollum, An investigation of variable neighbourhood search for university course timetabling, Proceedings of the 2 nd multidisciplinary international conference on scheduling: theory and applications (MISTA2005), New York, USA, 2005, pp. 413-427. H. Asmuni, E. K. Burke, and J. M. Garibaldi, Fuzzy multiple heuristic ordering for course timetabling, Proceedings of the 5th United Kingdom Workshop on Computational Intelligence (UKCI 2005), London, UK, 2005, pp. 302-309. 10.1023/b:heur.0000012446.94732.b6E. K. Burke, G. Kendall, and E. Soubeiga, A tabu-search hyperheuristic for timetabling and rostering, Journal of Heuristics, Vol.9, No.6, 2003, pp. 451-470, doi: 10.1023/B:HEUR. 0000012 446.94732.b6. 10.1007/978-3-540-45157-0_22O. Rossi-Doria, M. Sampels, M. Birattari, M. Chiarandini, M. Dorigo, L. M. Gambardella, J. Knowles, M. Manfrin, M. Mastrolilli, B. Paechter, L. Paquete, and T. Stützle, A comparison of the performance of different metaheuristics on the timetabling problem, Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT2002), Gent, Belgium, 2002, pp. 329-351, doi: 10.1007/978-3-540-45157-0_22.