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...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2005
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/38730/ http://psasir.upm.edu.my/id/eprint/38730/1/38730.pdf |
| _version_ | 1848848955073363968 |
|---|---|
| author | Md Sultan, Abu Bakar Mahmod, Ramlan Sulaiman, Md Nasir Abu Bakar, Mohd Rizam |
| author_facet | Md Sultan, Abu Bakar Mahmod, Ramlan Sulaiman, Md Nasir Abu Bakar, Mohd Rizam |
| author_sort | Md Sultan, Abu Bakar |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T09:42:43Z |
| format | Conference or Workshop Item |
| id | upm-38730 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T09:42:43Z |
| publishDate | 2005 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-387302015-06-04T06:47:12Z http://psasir.upm.edu.my/id/eprint/38730/ Exploiting fitness distance correlation (FDC) of timetabling instances Md Sultan, Abu Bakar Mahmod, Ramlan Sulaiman, Md Nasir Abu Bakar, Mohd Rizam 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. 2005 Conference or Workshop Item NonPeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/38730/1/38730.pdf Md Sultan, Abu Bakar and Mahmod, Ramlan and Sulaiman, Md Nasir and Abu Bakar, Mohd Rizam (2005) Exploiting fitness distance correlation (FDC) of timetabling instances. In: International Advanced Technology Congress: Conference on Computer Integrated Systems, 6-8 Dec. 2005, Putrajaya, Malaysia. . |
| spellingShingle | Md Sultan, Abu Bakar Mahmod, Ramlan Sulaiman, Md Nasir Abu Bakar, Mohd Rizam Exploiting fitness distance correlation (FDC) of timetabling instances |
| title | Exploiting fitness distance correlation (FDC) of timetabling instances |
| title_full | Exploiting fitness distance correlation (FDC) of timetabling instances |
| title_fullStr | Exploiting fitness distance correlation (FDC) of timetabling instances |
| title_full_unstemmed | Exploiting fitness distance correlation (FDC) of timetabling instances |
| title_short | Exploiting fitness distance correlation (FDC) of timetabling instances |
| title_sort | exploiting fitness distance correlation (fdc) of timetabling instances |
| url | http://psasir.upm.edu.my/id/eprint/38730/ http://psasir.upm.edu.my/id/eprint/38730/1/38730.pdf |