File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/CEC.2014.6900233
- Scopus: eid_2-s2.0-84908592847
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Chemical reaction optimization for the set covering problem
Title | Chemical reaction optimization for the set covering problem |
---|---|
Authors | |
Keywords | Set covering problem Chemical reaction optimization Heuristic Metaheuristic |
Issue Date | 2014 |
Publisher | IEEE. 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? |
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. © 2014 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/219834 |
ISBN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yu, JJQ | - |
dc.contributor.author | Lam, AYS | - |
dc.contributor.author | Li, VOK | - |
dc.date.accessioned | 2015-09-23T02:58:03Z | - |
dc.date.available | 2015-09-23T02:58:03Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | The 2014 IEEE Congress on Evolutionary Computation (CEC 2014), Beijing, China, 6-July 2014. In Conference Proceedings, 2014, p. 512-519 | - |
dc.identifier.isbn | 978-1-4799-1488-3 | - |
dc.identifier.uri | http://hdl.handle.net/10722/219834 | - |
dc.description.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. © 2014 IEEE. | - |
dc.language | eng | - |
dc.publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000284 | - |
dc.relation.ispartof | Congress 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.subject | Set covering problem | - |
dc.subject | Chemical reaction optimization | - |
dc.subject | Heuristic | - |
dc.subject | Metaheuristic | - |
dc.title | Chemical reaction optimization for the set covering problem | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Lam, AYS: ayslam@eee.hku.hk | - |
dc.identifier.email | Li, VOK: vli@eee.hku.hk | - |
dc.identifier.authority | Lam, AYS=rp02083 | - |
dc.identifier.authority | Li, VOK=rp00150 | - |
dc.description.nature | postprint | - |
dc.identifier.doi | 10.1109/CEC.2014.6900233 | - |
dc.identifier.scopus | eid_2-s2.0-84908592847 | - |
dc.identifier.hkuros | 254216 | - |
dc.identifier.hkuros | 254366 | - |
dc.identifier.spage | 512 | - |
dc.identifier.epage | 519 | - |
dc.publisher.place | United States | - |
dc.customcontrol.immutable | sml 151103 | - |