Chemical Reaction Optimization for the Set Covering Problem
James J.Q. Yu, Albert Y.S. Lam, Victor O.K. Li
TL;DR
This paper introduces a chemical reaction optimization algorithm tailored for the set covering problem, demonstrating superior performance over existing heuristics on various benchmark instances.
Contribution
It develops a novel metaheuristic approach using chemical reaction optimization specifically for solving the set covering problem.
Findings
Outperforms other heuristics and metaheuristics on benchmark instances
Effective in solving large and complex SCP instances
Demonstrates robustness and efficiency of CRO in combinatorial optimization
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.