Skip to Main content Skip to Navigation
Conference papers

Constrained GA optimization

Abstract : We present a general method of handling constraints in genetic optimization, based on the Behavioural Memory paradigm. Instead of requiring the problem-dependent design of either repair operators (projection on the feasible region) or penalty function (weighted sum of the constraints violations and the objective function), we sample the feasible region by evolving from an initially random population, successively applying a series of different fitness functions which embody constraint satisfaction. The final step is the optimization of the objective function restricted to the feasible region. The success of the whole process is highly dependent on the genetic diversity maintained during the first steps, ensuring a uniform sampling of the feasible region. This method succeeded on some truss structure optimization problems, where the other genetic techniques for handling the constraints failed to give good results. Moreover in some domains, as in automatic generation of software test data, no other technique can be easily applied, as some constraints are not even computable until others are satisfied.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-02985385
Contributor : Marc Schoenauer <>
Submitted on : Monday, November 2, 2020 - 10:38:30 AM
Last modification on : Monday, November 16, 2020 - 8:38:05 AM

File

xanthakisICGA93.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02985385, version 1

Collections

Citation

Marc Schoenauer, Spyros Xanthakis. Constrained GA optimization. Proc. 5th International Conference on Genetic Algorithms, Jun 1993, Urbana Champaign, United States. pp.573-580. ⟨hal-02985385⟩

Share

Metrics

Record views

24

Files downloads

28