File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Chemical reaction optimization for the set covering problem

TitleChemical reaction optimization for the set covering problem
Authors
Yu, JJQLam, AYSLi, VOK
KeywordsSet covering problem
Chemical reaction optimization
Heuristic
Metaheuristic
Issue Date2014
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000284
Citation
The 2014 IEEE Congress on Evolutionary Computation (CEC 2014), Beijing, China, 6-July 2014. In Conference Proceedings, 2014, p. 512-519 How to Cite?
DOI: http://dx.doi.org/10.1109/CEC.2014.6900233
AbstractThe 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. © 2014 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/219834
ISBN
978-1-4799-1488-3

 

DC FieldValueLanguage
dc.contributor.authorYu, JJQ-
dc.contributor.authorLam, AYS-
dc.contributor.authorLi, VOK-
dc.date.accessioned2015-09-23T02:58:03Z-
dc.date.available2015-09-23T02:58:03Z-
dc.date.issued2014-
dc.identifier.citationThe 2014 IEEE Congress on Evolutionary Computation (CEC 2014), Beijing, China, 6-July 2014. In Conference Proceedings, 2014, p. 512-519-
dc.identifier.isbn978-1-4799-1488-3-
dc.identifier.urihttp://hdl.handle.net/10722/219834-
dc.description.abstractThe 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. © 2014 IEEE.-
dc.languageeng-
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000284-
dc.relation.ispartofCongress on Evolutionary Computation (CEC)-
dc.rights©2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.-
dc.subjectSet covering problem-
dc.subjectChemical reaction optimization-
dc.subjectHeuristic-
dc.subjectMetaheuristic-
dc.titleChemical reaction optimization for the set covering problem-
dc.typeConference_Paper-
dc.identifier.emailLam, AYS: ayslam@eee.hku.hk-
dc.identifier.emailLi, VOK: vli@eee.hku.hk-
dc.identifier.authorityLam, AYS=rp02083-
dc.identifier.authorityLi, VOK=rp00150-
dc.description.naturepostprint-
dc.identifier.doi10.1109/CEC.2014.6900233-
dc.identifier.scopuseid_2-s2.0-84908592847-
dc.identifier.hkuros254216-
dc.identifier.hkuros254366-
dc.identifier.spage512-
dc.identifier.epage519-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 151103-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats