Solving the high school timetabling problem using a hybrid cat swarm optimization based algorithm

doi:10.1016/j.asoc.2016.10.038

Return

Solving the high school timetabling problem using a hybrid cat swarm optimization based algorithm

2017-03-01

PRE

Vassilios I. Skoullis

Ioannis X. Tassopoulos

Grigorios N. Beligiannis *

DOI：10.1016/j.asoc.2016.10.038

Original

Original request for help

Save

Abstract

En 中文

In this contribution we present the application of a hybrid cat swarm optimization (CSO) based algorithm for solving the school timetabling problem. This easy to use, efficient and fast algorithm is a hybrid variation of the classic CSO algorithm. Its efficiency and performance is demonstrated by conducting experiments with real-world input data. This data, collected from various high schools in Greece, has also been used as test instances by many other researchers in their publications. Results reveal that this hybrid CSO based algorithm, applied to the same school timetabling test instances using the same evaluation criteria, exhibits better performance in less computational time compared to the majority of other existing approaches, such as Genetic Algorithms (GAs), Evolutionary Algorithms (EAs), Simulated Annealing (SA), Particle Swarm Optimization (PSO) and Artificial Fish Swarm (AFS). The algorithm's main process constitutes a variation of the classic CSO algorithm, properly altered so as to be applied for solving the school timetabling problem. This process contains the main algorithmic differences of the proposed approach compared to other algorithms presented in the respective literature. (C) 2016 Elsevier B.V. All rights reserved.

Keywords:

Cat swarm optimization

Hybrid algorithm

School timetabling problem

Educational organization

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.