Chemical Reaction Optimization for the Set Covering Problem
arXiv:1502.00199 · doi:10.1109/CEC.2014.6900233
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.
References in corpus (4)
- Evolutionary Artificial Neural Network Based on Chemical Reaction Optimization
- Sensor Deployment for Air Pollution Monitoring Using Public Transportation System
- Optimal V2G Scheduling of Electric Vehicles and Unit Commitment using Chemical Reaction Optimization
- Real-Coded Chemical Reaction Optimization with Different Perturbation Functions