Research Article Open Access

A Constraint-Handling Technique for Genetic Algorithms using a Violation Factor

Adam Chehouri1, Rafic Younes2, Jean Perron1 and Adrian Ilinca3
  • 1 Université du Québec à Chicoutimi, Canada
  • 2 Lebanese University, Lebanon
  • 3 Université du Québec à Rimouski, Canada
Journal of Computer Science
Volume 12 No. 7, 2016, 350-362

DOI: https://doi.org/10.3844/jcssp.2016.350.362

Published On: 31 August 2016

How to Cite: Chehouri, A., Younes, R., Perron, J. & Ilinca, A. (2016). A Constraint-Handling Technique for Genetic Algorithms using a Violation Factor. Journal of Computer Science, 12(7), 350-362. https://doi.org/10.3844/jcssp.2016.350.362

Abstract

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.

Download

Keywords

  • Constraint-Handling
  • Genetic Algorithm
  • Constrained Optimization
  • Engineering Optimization
  • Evolutionary Algorithms