Exploiting fitness distance correlation (FDC) of timetabling instances
The Timetabling Problem is a combinatorial optimization problem. The University Course Timetabling Problems (UCTP) deal with the scheduling of the teaching program. In this paper we analyze the performance of Hybrid Evolutionary Metaheuristic for a set of timetabling instances benchmark through an a...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2005
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/38730/1/38730.pdf http://psasir.upm.edu.my/id/eprint/38730/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The Timetabling Problem is a combinatorial optimization problem. The University Course Timetabling Problems (UCTP) deal with the scheduling of the teaching program. In this paper we analyze the performance of Hybrid Evolutionary Metaheuristic for a set of timetabling instances benchmark through an analysis of the fitness-distance correlation (FDC) . FDC is a statistical measure of a search difficulty in relation to genetic algorithm. We propose new ways of FDC analysis. Initial result indicates that FDC can also be used in different ways of analysis as well as different problem instances. |
|---|