This paper introduces a hybrid Tabu Search - Evolutionary Algorithm for solving the binary constraint satisfaction problem, called CTLEA. A continuation of an earlier introduced al...
The problem of finding a high quality timetable for personnel in a hospital ward has been addressed by many researchers, personnel managers and schedulers over a number of years. ...
Edmund K. Burke, Patrick De Causmaecker, Sanja Pet...
This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main feature of GASAT is that it includes a recombination stage based on a specific crossov...
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
Louis-Martin Rousseau, Gilles Pesant, Michel Gendr...