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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2013 IEEE Congress on Evolutionary Computation s. 2201 - 2206
Hlavní autoři: Silva, Ricardo M. A., Resende, Mauricio G. C., Pardalos, Panos M., Faco, Joao L.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2013
Témata:
Decoding
Genetic algorithms
Linear programming
Optimization
Sociology
Statistics
Vectors
ISBN:1479904538, 9781479904532
ISSN:1089-778X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 constraints. Experimental results illustrate its effectiveness on some functions from CEC2006 benchmark (Liang et al. [2006]).
ISBN:1479904538
9781479904532
ISSN:1089-778X
DOI:10.1109/CEC.2013.6557830