@article{Hemert00,
	_day = {01},
	abstract = {Constraint satisfaction has been the subject of many studies. Different areas of research have tried to solve all kind of constraint problems. Here we will look at a general model for constraint satisfaction problems in the form of binary constraint satisfaction. The problems generated from this model are studied in the research area of constraint programming and in the research area of evolutionary computation. This paper provides an empirical comparison of two techniques from each area. Basically, this is a check on how well both areas are doing. It turns out that, although evolutionary algorithms are doing well, classic approaches are still more successful.},
	author = {van Hemert, J},
	date-added = {2008-08-18 12:44:11 +0100},
	date-modified = {2009-10-27 13:07:25 +0000},
	editor = {van den Bosch, A and H Weigand},
	journal = {Artificial Intelligence},
	keywords = {constraint satisfaction},
	organization = {{BNVKI}, Dutch and the Belgian {AI} Association},
	pages = {267--274},
	pdf = {http://www.vanhemert.co.uk/publications/bnaic00.Constraint_Satisfaction_Problems_and_Evolutionary_Computation:_A_Reality_Check.pdf},
	ps.gz = {http://www.vanhemert.co.uk/publications/bnaic00.Constraint_Satisfaction_Problems_and_Evolutionary_Computation:_A_Reality_Check.ps.gz},
	title = {Constraint Satisfaction Problems and Evolutionary Algorithms: A Reality Check},
	volume = {12},
	year = {2000}}