A hybrid algorithm of Harmony Search and Bees Algorithm for a University Course Timetabling Problem
This paper is concerned with the development of a new hybrid metaheuristic approach for solving a practical university course timetabling problem in Vietnam. Our hybrid method is a combination of Harmony Search (HS) algorithm and the Bees algorithm. The proposed method has been tested on 14 real-wor...
Gespeichert in:
Veröffentlicht in: | International journal of computer science issues 2012-01, Vol.9 (1), p.12-12 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This paper is concerned with the development of a new hybrid metaheuristic approach for solving a practical university course timetabling problem in Vietnam. Our hybrid method is a combination of Harmony Search (HS) algorithm and the Bees algorithm. The proposed method has been tested on 14 real-world data instances and compared with some other metaheurisitic approaches, which are Variable Neighborhood Search, Tabu Search and Bee Algorithms. Numerical results indicate the effectiveness of the hybrid HS - Bees algorithm over the others for the specific problem. |
---|---|
ISSN: | 1694-0814 1694-0784 |