A Study of Genetic ALgorithm for Timetabling Problem


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 6, pp. 1861-1866, Jun. 2000
10.3745/KIPSTE.2000.7.6.1861,   PDF Download:

Abstract

This paper describes a multi-constrained university timetabling problem that is a one of the field of artificial intelligent research area. For this problem, we propose the 2type edge graph that is can be represented time-conflict and day-conflict constraints simultaneously. The genetic algorithms are devised and considered for it. And we describe a method of local search in traditional random operator for its search efficiency. In computational experiments, the solutions of proposed method are average 71% costs that ware compared with solutions of random method in 10,000 iterations.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. I. Ahn, "A Study of Genetic ALgorithm for Timetabling Problem," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 6, pp. 1861-1866, 2000. DOI: 10.3745/KIPSTE.2000.7.6.1861.

[ACM Style]
Jong Il Ahn. 2000. A Study of Genetic ALgorithm for Timetabling Problem. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 6, (2000), 1861-1866. DOI: 10.3745/KIPSTE.2000.7.6.1861.