Incorporating of constraint-based reasoning into particle swarm optimization for university timetabling problem
Timetabling problems are often difficult and time-consuming task. It involves a set of timeslots, classrooms, subjects, students and lecturers. The complexity problem is the constraints that exist within the resources. Thus, a technique that can handle constraints is needed to optimize the problem....
Disimpan dalam:
| Pengarang-pengarang Utama: | , , |
|---|---|
| Format: | Artikel |
| Diterbitkan: |
2009
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://eprints.utm.my/11764/ http://eprints.utm.my/11764/ |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|
Jadilah orang pertama meninggalkan komen!