The course timetabling problem (CTP) is very important for educational institutes. An effective timetable has directly affect to the utilisation of resources and its operating costs. Solving the CTP manually without timetabling tool is extremely difficult, time consuming and may require a group of experts to work for several days. A course timetabling program, named a Hybrid Particle Swarm Optimisation-based Timetabling (HPSOT) tool, has been developed for optimising the academic operating costs. A variant of Particle Swarm Optimisation (PSO) named Maurice Clerc PSO (MCPSO) and its hybridisations with five combinations of insertion operator (IO) and exchange operator (EO) were proposed and embedded in the HPSOT program. The statistical analysis suggested that the results obtained from the hybrid MCPSO were statistically better than those results obtained from the conventional MCPSO for all instances. The average computational times taken by the proposed hybrid methods were quicker than the original MCPSO for all instances.
CITATION STYLE
Thepphakorn, T., Sooncharoen, S., & Pongcharoen, P. (2020). Academic Operating Costs Optimisation Using Hybrid MCPSO Based Course Timetabling Tool. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12218 LNCS, pp. 338–350). Springer. https://doi.org/10.1007/978-3-030-51968-1_28
Mendeley helps you to discover research relevant for your work.