Universiti Teknologi Malaysia Institutional Repository

A combination of PSO and local search in university course timetabling problem

Ho, Irene Sheau Fen and Deris, Safaai and Mohd Hashim, Siti Zaiton (2008) A combination of PSO and local search in university course timetabling problem. In: Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009. IEEE Computer Society, Washington, DC, USA, pp. 492-495. ISBN 978-0-7695-3521-0

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1109/ICCET.2009.188

Abstract

The university course timetabling problem is a combinatorial optimization problem concerning the scheduling of a number of subjects into a finite number of timeslots in order to satisfy a set of specified constraints. The timetable problem can be very hard to solve, especially when attempting to find a near-optimal solutions, with a large number of instances. This paper presents a combination of particle swarm optimization and local search to effectively search the solution space in solving university course timetabling problem. Three different types of dataset range from small to large are used in validating the algorithm. The experiment results show that the combination of particle swarm optimization and local search is capable to produce feasible timetable with less computational time, comparable to other established algorithms.

Item Type:Book Section
Uncontrolled Keywords:university course timetabling problem, particle swarm optimization, local search
Subjects:H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
Divisions:Computer Science and Information System (Formerly known)
ID Code:11722
Deposited By: Nor Asmida Abdullah
Deposited On:14 Jan 2011 02:31
Last Modified:17 Jan 2011 09:41

Repository Staff Only: item control page