DocumentCode :
3521531
Title :
Genetic algorithms vs. Tabu search in timetable scheduling
Author :
Chu, S.C. ; Fang, H.L.
Author_Institution :
Nat. Kaohsiung Inst. of Technol., Taiwan
fYear :
1999
fDate :
36495
Firstpage :
492
Lastpage :
495
Abstract :
In a timetabling problem, exam subjects must be slotted to certain times that satisfy several of constraints. They are NP-completeness problems, which usually lead to satisfactory but sub-optimal solutions. This paper investigates and compares Genetic Algorithm and Tabu Search approaches to solve these kinds of problem. The experiment shows that TS approach can produce better timetables than those of GA approach can. Further, the search time spent in TS is less than that of GA. However, GA can produce several different near optimal solutions simultaneously
Keywords :
computational complexity; genetic algorithms; scheduling; search problems; NP-completeness problems; Tabu search; genetic algorithms; near optimal solutions; sub-optimal solutions; timetable scheduling; Artificial intelligence; Australia; Genetic algorithms; Intelligent systems; Operations research; Polynomials; Processor scheduling; Steel; Transportation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Knowledge-Based Intelligent Information Engineering Systems, 1999. Third International Conference
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-5578-4
Type :
conf
DOI :
10.1109/KES.1999.820230
Filename :
820230
Link To Document :
بازگشت