期刊
OPTIMIZATION LETTERS
卷 6, 期 4, 页码 605-619出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s11590-011-0285-3
关键词
Steiner triple covering; Set covering; Genetic algorithm; Biased random-key genetic algorithm; Random keys; Combinatorial optimization; Heuristics; Metaheuristics
资金
- Fundacao para a Ciencia e Tecnologia (FCT) [PTDC/GES/72244/2006]
- Brazilian National Council for Scientific and Technological Development (CNPq)
- Foundation for Support of Research of the State of Minas Gerais, Brazil (FAPEMIG)
- Fundação para a Ciência e a Tecnologia [PTDC/GES/72244/2006] Funding Source: FCT
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 A(405) and A(729) have sizes 335 and 617, respectively. On all other smaller instances our algorithm consistently produces covers of optimal size.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据