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...

Full description

Saved in:
Bibliographic Details
Main Authors: Sheau, Irene Fen Ho, Deris, Safaai, Mohd. Hashim, Siti Zaiton
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!

Similar Items