Biased random-key genetic algorithm for nonlinearly-constrained global optimization
Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a biased random key genetic algorithm for finding approximate solutions for bound-constrained continuous global optimization problems subject to nonlinear constrain...
Saved in:
Published in | 2013 IEEE Congress on Evolutionary Computation pp. 2201 - 2206 |
---|---|
Main Authors | , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.06.2013
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!