Premium
Hybrid genetic algorithms for timetabling
Author(s) -
Monfroglio Angelo
Publication year - 1996
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/(sici)1098-111x(199608)11:8<477::aid-int1>3.0.co;2-i
Subject(s) - backtracking , computer science , genetic algorithm , heuristics , constraint satisfaction , mathematical optimization , constraint satisfaction problem , constraint logic programming , genetic programming , algorithm , artificial intelligence , mathematics , machine learning , probabilistic logic
Hybrid genetic algorithms are presented that use optimization heuristics and genetic techniques to outperform all existing programs for the timetabling problem. The timetabling problem is very hard (NP‐complete) and a general polynomial time deterministic algorithm is not known. An artificial intelligence approach, in a logic programming environment, may be useful for such a problem. The decomposition and classification of constraints and the constraint ordering to obtain the minimization of the backtracking and the maximization of the parallelism are illustrated. The school timetabling problem is discussed in detail as a case study. The genetic algorithm approach is particularly well suited for this kind of problem, since there exists an easy way to assess a good timetable but not a well‐structured automatic technique for constructing it. So, a population of timetables is created that evolves toward the best solutions. The evaluation function and the genetic operators are well separated from the domain‐specific parts, such as the problem knowledge and the heuristics, i.e., from the timetable builder. A fundamental issue and a general problem in the decision process and automated reasoning is how to efficiently obtain logic decisions under disjunctive constraints. Logic constraint satisfaction problems are in general NP‐hard and a general deterministic polynomial time algorithm is not known. The present article illustrates an approach based on the hybridization of constrained heuristic search with novel genetic algorithm techniques. It compares favorably with the best‐known programs to solve decisions problems under logic constraints. Complexity of the new algorithms and results of significant experiments are reported. © 1996 John Wiley & Sons, Inc.