8 search results - page 1 / 2 » Iterated local search vs. hyper-heuristics: Towards general-... |
CEC
2010
IEEE
13 years 6 months ago
2010
IEEE
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...
IPPS
2010
IEEE
13 years 2 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
SGAI
2007
Springer
13 years 11 months ago
2007
Springer
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
UAI
2003
13 years 6 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
In this paper we propose a novel iterative search procedure for multi-objective optimization problems. The iteration process – though derivative free – utilizes the geometry o...