Varying fitness functions in genetic algorithm constrained optimization: the cutting stock and unit commitment problems.

We present a specific varying fitness function technique in genetic algorithm (GA) constrained optimization. This technique incorporates the problem's constraints into the fitness function in a dynamic way. It consists of forming a fitness function with varying penalty terms.