In this work we conduct a comparative study ofseveral publicly available, state-of-the-art hyper-heuristics forHyFlex in order to assess their generality across domains. Tothis purpose we extend the HyFlex benchmark set with 3 newproblem domains: The 0-1 Knap Sack, Quadratic Assignmentand Max-Cut Problem. To our knowledge, this is the first publicextension of the benchmark since the CHeSC 2011 competition.In addition, this is the first study testing the Fair-Share IteratedLocal Search (FS-ILS) method, designed in prior research, usinga semi-automated design approach, on new unseen problemdomains. We show that, of the methods compared, Adap-HH(CHeSC 2011 winner) clearly perfoms the most consistently,overall. In addition, we identify a weakness of, as well as away to further simplify the FS-ILS method. Finally, we foundthat, overall, the state-of-the-art methods compared, generalizedmuch better than a naive baseline.
Adriaensen, S, Ochoa, G & Nowe, A 2015, A Benchmark Set Extension and Comparative Study for the HyFlex Framework. in Evolutionary Computation (CEC), 2015 IEEE Congress on Evolutionary Computation (CEC). IEEE, pp. 784-791, 2015 IEEE Congress on Evolutionary Computation, United Kingdom, 25/05/15.
Adriaensen, S., Ochoa, G., & Nowe, A. (2015). A Benchmark Set Extension and Comparative Study for the HyFlex Framework. In Evolutionary Computation (CEC), 2015 IEEE Congress on Evolutionary Computation (CEC) (pp. 784-791). IEEE.
@inproceedings{3268115b3d4a43efb106ae96baa7429b,
title = "A Benchmark Set Extension and Comparative Study for the HyFlex Framework.",
abstract = "In this work we conduct a comparative study ofseveral publicly available, state-of-the-art hyper-heuristics forHyFlex in order to assess their generality across domains. Tothis purpose we extend the HyFlex benchmark set with 3 newproblem domains: The 0-1 Knap Sack, Quadratic Assignmentand Max-Cut Problem. To our knowledge, this is the first publicextension of the benchmark since the CHeSC 2011 competition.In addition, this is the first study testing the Fair-Share IteratedLocal Search (FS-ILS) method, designed in prior research, usinga semi-automated design approach, on new unseen problemdomains. We show that, of the methods compared, Adap-HH(CHeSC 2011 winner) clearly perfoms the most consistently,overall. In addition, we identify a weakness of, as well as away to further simplify the FS-ILS method. Finally, we foundthat, overall, the state-of-the-art methods compared, generalizedmuch better than a naive baseline.",
author = "Steven Adriaensen and Gabriela Ochoa and Ann Nowe",
year = "2015",
month = may,
day = "25",
language = "English",
isbn = "978-1-4799-7492-4",
pages = "784--791",
booktitle = "Evolutionary Computation (CEC), 2015 IEEE Congress on Evolutionary Computation (CEC)",
publisher = "IEEE",
note = "2015 IEEE Congress on Evolutionary Computation, CEC ; Conference date: 25-05-2015 Through 28-05-2015",
}