@article{HB2004,
	_day = {17},
	abstract = {In this article, we try to provide insight into the consequence of mutation and crossover rates when solving binary constraint satisfaction problems. This insight is based on a measurement of the space searched by an evolutionary algorithm. From data empirically acquired we describe the relation between the success ratio and the searched space. This is achieved using the resampling ratio, which is a measure for the amount of points revisited by a search algorithm. This relation is based on combinations of parameter settings for the variation operators. We then show that the resampling ratio is useful for identifying the quality of parameter settings, and provide a range that corresponds to robust parameter settings.},
	annote = {ISI 0.551 in 2005},
	author = {van Hemert, J and T B{\"a}ck},
	date-added = {2008-08-18 12:42:43 +0100},
	date-modified = {2009-01-22 19:52:05 +0000},
	journal = {Journal of Heuristics},
	keywords = {evolutionary computation; constraint satisfaction},
	notedisabled = {\textsc{ISI impact factor = 0.644 (2007)}},
	number = {6},
	pages = {629--40},
	title = {Robust parameter settings for variation operators by measuring the resampling ratio},
	volume = {10},
	year = {2004}}