Title :
Hybrid Heuristics for Solving the Constraints Modeled High School Scheduling Problem
Author :
Chorbev, Ivan ; Dimitrovski, Ivica ; Mihajlov, Dragan ; Loskovska, Suzana
Author_Institution :
Inst. for Comput. Sci. & Eng. Skopje, Skopje
Abstract :
This article describes the solving process of the high school scheduling problem. Hybrid heuristic algorithms are applied to the constraint modeled problem. Constraint satisfaction is used to model the problem by the classes of the constraint solving engine (CSE) and a constraint programming library (CPL) which we previously developed The main hybrid algorithm used was based on simulated annealing, greedy search, guided search, and memory from Tabu search.
Keywords :
constraint handling; educational administrative data processing; scheduling; search problems; simulated annealing; software libraries; Tabu search; constraint modeled problem; constraint programming library; constraint solving engine; greedy search; guided search; high school scheduling problem; simulated annealing; Computer science; Constraint optimization; Heuristic algorithms; Hybrid power systems; Information technology; NP-hard problem; Processor scheduling; Simulated annealing; Symbiosis; System recovery; Constraint Programming; High School Scheduling; Hybrid Heuristics; Simulated Annealing; Tabu Search; Temporal and Spatial Scheduling;
Conference_Titel :
EUROCON, 2007. The International Conference on "Computer as a Tool"
Conference_Location :
Warsaw
Print_ISBN :
978-1-4244-0813-9
Electronic_ISBN :
978-1-4244-0813-9
DOI :
10.1109/EURCON.2007.4400478
