Title :
Chemical reaction optimization for the set covering problem
Author :
Yu, James J. Q. ; Lam, Albert Y. S. ; Li, Victor O. K.
Author_Institution :
Dept. of Electr. & Electron. Eng., Univ. of Hong Kong, Hong Kong, China
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.
Keywords :
computational complexity; optimisation; set theory; CRO; NP-hard optimization problem; chemical reaction optimization; general-purpose metaheuristic; representative combinatorial optimization problem; set covering problem; Algorithm design and analysis; Approximation algorithms; Encoding; Heuristic algorithms; Maintenance engineering; Optimization; Vectors; Set covering problem; chemical reaction optimization; heuristic; metaheuristic;
Conference_Titel :
Evolutionary Computation (CEC), 2014 IEEE Congress on
Conference_Location :
Beijing
Print_ISBN :
978-1-4799-6626-4
DOI :
10.1109/CEC.2014.6900233
