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!
|
| Summary: | 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. |
|---|