Comparison of static and dynamic penalty functions for handling constraints in genetic algorithm applied to course timetabling for CSM in UPMin
This study presents an application of generic algorithm (GA) on university course timetabling problem using penalty functions were utilized as fitness function, penalizing only on the soft constraints since all hard constraints must be satisfied. One is static penalty function having a fixed penalty...
| Κύριος συγγραφέας: | |
|---|---|
| Μορφή: | Thesis |
| Γλώσσα: | English |
| Έκδοση: |
2006
|
| Θέματα: |