集合覆盖问题的化学反应优化
Chemical Reaction Optimization for the Set Covering Problem
摘要：
集合覆盖问题（SCP）是组合优化的代表性问题之一，有着广泛的实际应用。本文研究了一种算法的发展，解决SCP采用化学反应优化（CRO），一个通用的元启发式。它在SCP的广泛基准实例上进行了测试。仿真结果表明，该算法在求解SCP问题时，与其他算法和元算法相比，具有优异的性能。
英文摘要：
The set covering problem (SCP) is one of the representative combinatorial optimization problems, having many practical applications. This paper investigates the development of an algorithm to solve SCP by employing chemical reaction optimization (CRO), a general-purpose metaheuristic. It is tested on a wide range of benchmark instances of SCP. The simulation results indicate that this algorithm gives outstanding performance compared with other heuristics and metaheuristics in solving SCP.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
