A biased random-key genetic algorithm for the Steiner triple covering problem

  • José Fernando Gonçalves
  • Mauricio G.C. Resende
  • Ricardo M. A. Silva
  • Rodrigo F. Toso
    • Categories Combinatorial Optimization, Meta Heuristics, Parallel Algorithms Tags , , , , , , , Short URL: https://optimization-online.org/?p=11337

    We present a biased random-key genetic algorithm (BRKGA) for finding small covers of computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems. Using a parallel implementation of the BRKGA, we compute improved covers for the two largest instances in a standard set of test problems used to evaluate solution procedures for this problem. The new covers for instances A405 and A729 have sizes 335 and 617, respectively. On all other smaller instances our algorithm consistently produces covers of optimal size.

    Citation

    AT&T Labs Research Technical Report, Florham Park, New Jersey, Oct. 2010

    Article

    Download

    View A biased random-key genetic algorithm for the Steiner triple covering problem