CAJ | 학술논문

集合覆盖问题的搜索算法有着广泛的应用。本文提出了一个有效求解集合覆盖问题的分散搜索算法，该算法根据集合覆盖问题的特点，以及参考集的产生方法和更新方法，并采用45个标准测试例子测试此算法，通过数值实验结果与遗传算法、基因文化算法的比较，结果表明了此算法是有效的。
집합복개문제적수색산법유착엄범적응용。본문제출료일개유효구해집합복개문제적분산수색산법，해산법근거집합복개문제적특점，이급삼고집적산생방법화경신방법，병채용45개표준측시례자측시차산법，통과수치실험결과여유전산법、기인문화산법적비교，결과표명료차산법시유효적。
The set covering problem has wide applications .In this paper , an efficient scatter search algorithm is proposed to solve the set covering problem .According to the structure of the set covering problem , a reference set generation method , a solution improvement method , a solution combination method and a reference set update method are developed .The experiments were done on 45 benchmarks from the literature .Numerical results and comparisons with genetic algorithm and culture algorithm indicate that the proposed algorithm is efficient .