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

Journal of Computer Science

Adrian Ilinca¹  Adam Chehouri¹  Jean Perron¹  Rafic Younes¹ 

关键词: Constraint-Handling;    Genetic Algorithm;    Constrained Optimization;    Engineering Optimization;    Evolutionary Algorithms;   

DOI  :  10.3844/jcssp.2016.350.362

学科分类：计算机科学（综合）

来源: Science Publications

【 摘 要 】

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.

【 授权许可】

Unknown