J.F. Gonçalves, M.G.C. Resende, and R.F. Toso
AT&T Labs Technical Report, 2012
ABSTRACT
We study the
runtime performance of three types of random-key genetic algorithms:
the unbiased algorithm of Bean (1994); the biased algorithm of
Gonçalves and Resende (2011); and a greedy version of Bean’s algorithm
on 12 instances from four types of covering problems: general-cost set
covering, Steiner triple covering, general-cost set k-covering, and
unit-cost covering by pairs. The experiments show that in 11 of
the 12 instances, the greedy version of Bean’s algorithm is faster than
Bean’s original method and that the biased variant is faster than both
variants of Bean’s algorithm.
PDF file of full paper
Last modified: 06 February 2013