In this paper, we evaluate parameter control strategies for evolutionary approaches to solve constrained combinatorial problems. For testing, we have used two well known evolutionary algorithms that solve the Constraint Satisfaction Problems GSA and SAW. We contrast our results with REVAC, a recently proposed technique for parameter tuning.