Next Article in Journal / Special Issue
Fast Rescheduling of Multiple Workflows to Constrained Heterogeneous Resources Using Multi-Criteria Memetic Computing
Previous Article in Journal
Enforcing Security Mechanisms in the IP-Based Internet of Things: An Algorithmic Overview
Algorithms 2013, 6(2), 227-244; doi:10.3390/a6020227
Article

Solving University Course Timetabling Problems Using Constriction Particle Swarm Optimization with Local Search

1,*  and 2
Received: 19 February 2013; in revised form: 25 March 2013 / Accepted: 8 April 2013 / Published: 19 April 2013
Download PDF [387 KB, updated 24 June 2013; original version uploaded 19 April 2013]
Abstract: Course timetabling is a combinatorial optimization problem and has been confirmed to be an NP-complete problem. Course timetabling problems are different for different universities. The studied university course timetabling problem involves hard constraints such as classroom, class curriculum, and other variables. Concurrently, some soft constraints need also to be considered, including teacher’s preferred time, favorite class time etc. These preferences correspond to satisfaction values obtained via questionnaires. Particle swarm optimization (PSO) is a promising scheme for solving NP-complete problems due to its fast convergence, fewer parameter settings and ability to fit dynamic environmental characteristics. Therefore, PSO was applied towards solving course timetabling problems in this work. To reduce the computational complexity, a timeslot was designated in a particle’s encoding as the scheduling unit. Two types of PSO, the inertia weight version and constriction version, were evaluated. Moreover, an interchange heuristic was utilized to explore the neighboring solution space to improve solution quality. Additionally, schedule conflicts are handled after a solution has been generated. Experimental results demonstrate that the proposed scheme of constriction PSO with interchange heuristic is able to generate satisfactory course timetables that meet the requirements of teachers and classes according to the various applied constraints.
Keywords: course timetabling; soft constraint; particle swarm optimization; constriction factor; interchange course timetabling; soft constraint; particle swarm optimization; constriction factor; interchange
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Export to BibTeX |
EndNote


MDPI and ACS Style

Chen, R.-M.; Shih, H.-F. Solving University Course Timetabling Problems Using Constriction Particle Swarm Optimization with Local Search. Algorithms 2013, 6, 227-244.

AMA Style

Chen R-M, Shih H-F. Solving University Course Timetabling Problems Using Constriction Particle Swarm Optimization with Local Search. Algorithms. 2013; 6(2):227-244.

Chicago/Turabian Style

Chen, Ruey-Maw; Shih, Hsiao-Fang. 2013. "Solving University Course Timetabling Problems Using Constriction Particle Swarm Optimization with Local Search." Algorithms 6, no. 2: 227-244.


Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert