期刊名称:International Journal of Computer Science and Network Security
印刷版ISSN:1738-7906
出版年度:2006
卷号:6
期号:6
页码:20-22
出版社:International Journal of Computer Science and Network Security
摘要:The Timetabling Problem is a combinatorial optimization problem. Over the last decade variant of Metaheuristic approaches have been used to solve various type of Timetabling Problem with great success. Metaheuristic are approximate algorithm used when the size of the search and spaces becomes unmanageable. However the stochastic nature of metaheuristic make it difficult to measure the performance of the algorithms. In this paper we analyze the performance of Hybrid Evolutionary Metaheuristic for a set of benchmark timetabling instances 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.