Chemical reaction optimization for the set covering problem

James J.Q. Yu*, Yun Sang Albert LAM, Victor O.K. Li

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference contributionpeer-review

7 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages512-519
Number of pages8
ISBN (Electronic)9781479914883
DOIs
Publication statusPublished - 16 Sep 2014
Event2014 IEEE Congress on Evolutionary Computation, CEC 2014 - Beijing, China
Duration: 6 Jul 201411 Jul 2014

Publication series

NameProceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014

Conference

Conference2014 IEEE Congress on Evolutionary Computation, CEC 2014
Country/TerritoryChina
CityBeijing
Period6/07/1411/07/14

Scopus Subject Areas

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Theoretical Computer Science

User-Defined Keywords

  • chemical reaction optimization
  • heuristic
  • metaheuristic
  • Set covering problem

Fingerprint

Dive into the research topics of 'Chemical reaction optimization for the set covering problem'. Together they form a unique fingerprint.

Cite this