AN EXPERIMENTAL COMPARISON OF BIASED AND UNBIASED RANDOM-KEY GENETIC ALGORITHMS
Random key genetic algorithms are heuristic methods for solving combinatorial optimization problems. They represent solutions as vectors of randomly generated real numbers, the so-called random keys. A deterministic algorithm, called a decoder, takes as input a vector of random keys and associates w...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Sociedade Brasileira de Pesquisa Operacional
2014-05-01
|
Series: | Pesquisa Operacional |
Subjects: | |
Online Access: | http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382014000200143&lng=en&tlng=en |