A Constraint-Handling Technique for Genetic Algorithms using a Violation Factor
- 1 Université du Québec à Chicoutimi, Canada
- 2 Lebanese University, Lebanon
- 3 Université du Québec à Rimouski, Canada
Copyright: © 2021 Adam Chehouri, Rafic Younes, Jean Perron and Adrian Ilinca. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Over the years, several meta-heuristic algorithms were proposed and are now emerging as common methods for constrained optimization problems. Among them, genetic algorithms (GA’s) shine as popular evolutionary algorithms (EA’s) in engineering optimization. Most engineering design problems are difficult to resolve with conventional optimization algorithms because they are highly nonlinear and contain constraints. In order to handle these constraints, the most common technique is to apply penalty functions. The major drawback is that they require tuning of parameters, which can be very challenging. In this paper, we present a constraint-handling technique for GA’s solely using the violation factor, called VCH (Violation Constraint-Handling) method. Several benchmark problems from the literature are examined. The VCH technique was able to provide a consistent performance and match results from other GA-based techniques.
- 1,318 Views
- 1,089 Downloads
- 17 Citations
- Genetic Algorithm
- Constrained Optimization
- Engineering Optimization
- Evolutionary Algorithms