This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
We study a selected group of hybrid EAs for solving CSPs, consisting of the best performing EAs from the literature. We investigate the contribution of the evolutionary component t...
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
Abstract. This paper describes a hybrid grouping genetic algorithm for a multiprocessor scheduling problem, where a list of tasks has to be scheduled on identical parallel processo...