论文信息 - Biased and unbiased random-key genetic algorithms : An experimental analysis ⋆

Biased and unbiased random-key genetic algorithms : An experimental analysis ⋆

We study the runtime performance of three types of randomkey 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.

Mauricio G. C. Resende | Rodrigo F. Toso | José F. Gonçalves

[1] Yu Gu,et al. Disjoint-Path Facility Location: Theory and Practice , 2011, ALENEX.

[2] Mauricio G. C. Resende,et al. Biased random-key genetic algorithms for combinatorial optimization , 2011, J. Heuristics.

[3] W. Spears,et al. On the Virtues of Parameterized Uniform Crossover , 1995 .

[4] M. Resende,et al. Greedy Randomized Adaptive Search Procedures. , 2003 .

[5] Mauricio G. C. Resende,et al. A biased random-key genetic algorithm for the Steiner triple covering problem , 2012, Optim. Lett..

[6] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.

[7] James C. Bean,et al. Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[8] Celso C. Ribeiro,et al. A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering , 2013, Comput. Oper. Res..

[9] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11] Celso C. Ribeiro,et al. Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms , 2012, J. Glob. Optim..