Sciweavers

6976 search results - page 94 / 1396
» The Oil Searching Problem
Sort
View
CP
2003
Springer
15 years 11 months ago
Using Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Jean-Charles Régin
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 9 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius
ECAI
2000
Springer
15 years 9 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon
GECCO
2000
Springer
150views Optimization» more  GECCO 2000»
15 years 9 months ago
A Hybrid Genetic Algorithm for the Quadratic Assignment Problem
A heuristic technique that combines a genetic algorithm with a Tabu Search algorithm is applied to the Quadratic Assignment Problem (QAP). The hybrid algorithm improves the result...
Manuel Vázquez, L. Darrell Whitley
AIPS
2004
15 years 7 months ago
Trading Places: How to Schedule More in a Multi-Resource Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing tasks when enough resources are not available. Prior AI approaches have mostly been constructive or repairbased heuristic searc...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...