User Settings
Article

Exploiting fitness distance correlation (FDC) of timetabling instances

Abu Bakar Md Sultan,Ramlan Mahmod,Nasir Sulaiman,Mohd Rizam Abu Bakar-2005-01-01
0

TL;DRAbstract

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.

Chat with Paper

AI Agents for this Paper

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.

Keywords

MetaheuristicScheduling (production processes)Distance correlationComputer scienceRelation (database)Benchmark (surveying)Set (abstract data type)Mathematical optimization

Chat

Click to start Chat