Sciweavers

155 search results - page 5 / 31
» A Conflict Tabu Search Evolutionary Algorithm for Solving Co...
Sort
View
CEC
2005
IEEE
14 years 1 months ago
Hybrid evolutionary algorithms for constraint satisfaction problems: memetic overkill?
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...
Bart G. W. Craenen, A. E. Eiben
IJCAI
2003
13 years 8 months ago
Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
Christian Bessière, Anaïs Fabre, Ulric...
HICSS
2005
IEEE
131views Biometrics» more  HICSS 2005»
14 years 1 months ago
Train Traffic Deviation Handling Using Tabu Search and Simulated Annealing
This paper addresses the problem of solving conflicts in railway traffic that arise due to disturbances. It is formulated as a problem of re-scheduling meets and overtakes of trai...
Johanna Törnquist, Jan A. Persson
CSR
2010
Springer
14 years 9 days ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
Uwe Schöning
EOR
2010
110views more  EOR 2010»
13 years 7 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao