Related Experiment Video
Updated: Jul 7, 2026

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
Published on: October 14, 2017
Varying fitness functions in genetic algorithm constrained optimization: the cutting stock and unit commitment
V Petridis1, S Kazarlis, A Bakirtzis
1Dept. of Electr. & Comput. Eng., Aristotelian Univ. of Thessaloniki.
Abstract:
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. The resulting varying fitness function facilitates the GA search. The performance of the technique is tested on two optimization problems: the cutting stock, and the unit commitment problems. Also, new domain-specific operators are introduced. Solutions obtained by means of the varying and the conventional (nonvarying) fitness function techniques are compared. The results show the superiority of the proposed technique.
Related Concept Videos
Lagrange Multipliers: Two Constraints
Optimization Problems
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Lagrange Multipliers: Problem Solving
Methods of Medium Optimization
Lagrange Multipliers: One Constraint
