To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
Course Timetabling Using Forest Algorithm |
|
Author |
Vahideh Sahargahi, Mohammadreza Feizi Derakhshi |
| Citation |
Vol. 17 No. 2 pp. 83-93 |
|
Abstract |
The timetabling problem is a subset of NP-Complete problems for which numerous solutions and studies have been presented. Algorithms provided for course timetabling use methods such as Particle Swarm Optimization (PSO), Memetic, fuzzy systems, Harmony Search approach and Ant Colony. The Forest algorithm is an optimization method proposed in recent years by researchers for optimization problems. In this article, it is used for course timetabling. Evaluation and comparison of the Forest algorithm with the Genetics Algorithm (GA) in 21 different databases showed its higher accuracy than GA. It also had a shorter runtime and achieved better results in less time. |
|
Keywords |
Course timetabling, evolutionary algorithm, Forest algorithm |
|
URL |
