Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Constraint-Handling Technique for Genetic Algorithms using a Violation Factor (1610.00976v1)

Published 4 Oct 2016 in cs.AI and math.OC

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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Adam Chehouri (2 papers)
  2. Rafic Younes (4 papers)
  3. Jean Perron (2 papers)
  4. Adrian Ilinca (2 papers)
Citations (54)

Summary

We haven't generated a summary for this paper yet.