Abstract
The aim of this work is to study the applicability of Genetic Algorithms (GAs) and stochastic local search methods to solve real time and over constrained temporal constraint problems. Solving these two type of problems consists of finding a possible scenario (solution) satisfying the temporal constraints within a given deadline. In the case where a complete scenario satisfying the constraints cannot be found, a partial one maximizing the number of solved constraints should be returned. This is an optimization problem where the objective function corresponds to the number of solved constraints. Experimental comparison of genetic algorithms and three stochastic local search methods have been conducted on randomly generated temporal constraint problems. The results of the experimentation favour the Min-Conflicts-Random-Walk (MCRW) local search method for under constrained problems while the GA based method is the technique of choice for middle constrained and over constrained problems.
Get full access to this article
View all access options for this article.