A combination of PSO and local search in university course timetabling problem
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 fin...
Saved in:
Main Authors: | , , |
---|---|
Format: | Book Section |
Language: | English |
Published: |
IEEE Computer Society
2008
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/11722/1/A%20combination%20of%20PSO%20and%20local%20search%20in%20university%20course%20timetabling%20problem_2007.pdf http://eprints.utm.my/id/eprint/11722/ http://dx.doi.org/10.1109/ICCET.2009.188 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.utm.11722 |
---|---|
record_format |
eprints |
spelling |
my.utm.117222017-10-02T04:42:26Z http://eprints.utm.my/id/eprint/11722/ A combination of PSO and local search in university course timetabling problem Sheau, Irene Fen Ho Deris, Safaai Mohd. Hashim, Siti Zaiton HD28 Management. Industrial Management 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. IEEE Computer Society 2008 Book Section PeerReviewed application/pdf en http://eprints.utm.my/id/eprint/11722/1/A%20combination%20of%20PSO%20and%20local%20search%20in%20university%20course%20timetabling%20problem_2007.pdf Sheau, Irene Fen Ho 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 http://dx.doi.org/10.1109/ICCET.2009.188 doi:10.1109/ICCET.2009.188 |
institution |
Universiti Teknologi Malaysia |
building |
UTM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Teknologi Malaysia |
content_source |
UTM Institutional Repository |
url_provider |
http://eprints.utm.my/ |
language |
English |
topic |
HD28 Management. Industrial Management |
spellingShingle |
HD28 Management. Industrial Management Sheau, Irene Fen Ho Deris, Safaai Mohd. Hashim, Siti Zaiton A combination of PSO and local search in university course timetabling problem |
description |
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. |
format |
Book Section |
author |
Sheau, Irene Fen Ho Deris, Safaai Mohd. Hashim, Siti Zaiton |
author_facet |
Sheau, Irene Fen Ho Deris, Safaai Mohd. Hashim, Siti Zaiton |
author_sort |
Sheau, Irene Fen Ho |
title |
A combination of PSO and local search in university course timetabling problem |
title_short |
A combination of PSO and local search in university course timetabling problem |
title_full |
A combination of PSO and local search in university course timetabling problem |
title_fullStr |
A combination of PSO and local search in university course timetabling problem |
title_full_unstemmed |
A combination of PSO and local search in university course timetabling problem |
title_sort |
combination of pso and local search in university course timetabling problem |
publisher |
IEEE Computer Society |
publishDate |
2008 |
url |
http://eprints.utm.my/id/eprint/11722/1/A%20combination%20of%20PSO%20and%20local%20search%20in%20university%20course%20timetabling%20problem_2007.pdf http://eprints.utm.my/id/eprint/11722/ http://dx.doi.org/10.1109/ICCET.2009.188 |
_version_ |
1643645758090510336 |
score |
13.250719 |