File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Design Of An Efficient Hyper-heuristic Algorithm Cma-vns For Combinatorial Black-box Optimization Problems

TitleDesign Of An Efficient Hyper-heuristic Algorithm Cma-vns For Combinatorial Black-box Optimization Problems
Authors
KeywordsCMA-VNS
Combinatorial black-box optimization
Hyperheuristics
NK-model
Issue Date2017
PublisherAssociation for Computing Machinery.
Citation
The Genetic and Evolutionary Computation Conference (GECCO), Berlin, Germany, 15-19 July 2017. In Proceedings of the Genetic and Evolutionary Computation Conference Companion, p. 1157-1162 How to Cite?
AbstractWe present a hyper-heuristic algorithm for solving combinatorial black-box optimization problems. The algorithm named CMA-VNS stands for a hybrid of variants of Covariance Matrix Adaptation Evolution Strategy (CMA-ES) and Variable Neighborhood Search (VNS). The framework design and the design profiles of variants of CMA-VNS are introduced to enhance the intensification of searching for conventional CMA-ES solvers. We explain the parameter configuration details, the heuristic profile selection, and the rationale of incorporating machine learning methods during the study. Experimental tests and the results of the first and the second Combinatorial Black-Box Optimization Competitions (CB-BOC 2015, 2016) confirmed that CMA-VNS is a competitive hyper-heuristic algorithm.
Persistent Identifierhttp://hdl.handle.net/10722/241820
ISBN
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorXue, F-
dc.contributor.authorShen, G-
dc.date.accessioned2017-06-20T01:49:00Z-
dc.date.available2017-06-20T01:49:00Z-
dc.date.issued2017-
dc.identifier.citationThe Genetic and Evolutionary Computation Conference (GECCO), Berlin, Germany, 15-19 July 2017. In Proceedings of the Genetic and Evolutionary Computation Conference Companion, p. 1157-1162-
dc.identifier.isbn978-1-4503-4939-0-
dc.identifier.urihttp://hdl.handle.net/10722/241820-
dc.description.abstractWe present a hyper-heuristic algorithm for solving combinatorial black-box optimization problems. The algorithm named CMA-VNS stands for a hybrid of variants of Covariance Matrix Adaptation Evolution Strategy (CMA-ES) and Variable Neighborhood Search (VNS). The framework design and the design profiles of variants of CMA-VNS are introduced to enhance the intensification of searching for conventional CMA-ES solvers. We explain the parameter configuration details, the heuristic profile selection, and the rationale of incorporating machine learning methods during the study. Experimental tests and the results of the first and the second Combinatorial Black-Box Optimization Competitions (CB-BOC 2015, 2016) confirmed that CMA-VNS is a competitive hyper-heuristic algorithm.-
dc.languageeng-
dc.publisherAssociation for Computing Machinery.-
dc.relation.ispartofGenetic and Evolutionary Computation Conference (GECCO)-
dc.rightsGenetic and Evolutionary Computation Conference (GECCO). Copyright © Association for Computing Machinery.-
dc.subjectCMA-VNS-
dc.subjectCombinatorial black-box optimization-
dc.subjectHyperheuristics-
dc.subjectNK-model-
dc.titleDesign Of An Efficient Hyper-heuristic Algorithm Cma-vns For Combinatorial Black-box Optimization Problems-
dc.typeConference_Paper-
dc.identifier.emailXue, F: xuef@hku.hk-
dc.identifier.authorityXue, F=rp02189-
dc.identifier.doi10.1145/3067695.3082054-
dc.identifier.scopuseid_2-s2.0-85026890209-
dc.identifier.hkuros272519-
dc.identifier.spage1157-
dc.identifier.epage1162-
dc.identifier.isiWOS:000625865500201-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats