Sciweavers

1800 search results - page 8 / 360
» Learning Restart Strategies
Sort
View
122
Voted
JAL
2008
97views more  JAL 2008»
15 years 3 months ago
Experimental studies of variable selection strategies based on constraint weights
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
Richard J. Wallace, Diarmuid Grimes
100
Voted
ICML
1991
IEEE
15 years 7 months ago
A Smallest Generalization Step Strategy
Claire Nedellec
157
Voted
HM
2007
Springer
180views Optimization» more  HM 2007»
15 years 7 months ago
Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems
We present two hybrid Metaheuristics, a hybrid Iterated Local Search and a hybrid Simulated Annealing, for solving real-world extensions of the Vehicle Routing Problem with Time Wi...
Tonci Caric, Juraj Fosin, Ante Galic, Hrvoje Gold,...
168
Voted
GECCO
2010
Springer
195views Optimization» more  GECCO 2010»
15 years 1 months ago
Black-box optimization benchmarking the IPOP-CMA-ES on the noiseless testbed: comparison to the BIPOP-CMA-ES
We benchmark the Covariance Matrix Adaptation-Evolution Strategy (CMA-ES) algorithm with an Increasing POPulation size (IPOP) restart policy on the BBOB noiseless testbed. The IPO...
Raymond Ros