150 search results - page 6 / 30 » Hybrid Constraint Tightening for Solving Hybrid Scheduling P... |
HEURISTICS
2002
13 years 8 months ago
2002
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...
CEC
2005
IEEE
14 years 2 months ago
2005
IEEE
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...
CPAIOR
2006
Springer
14 years 4 days ago
2006
Springer
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...
ANOR
2002
13 years 8 months ago
2002
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...
IC3
2009
13 years 6 months ago
2009
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...