Log In

A benchmark generator of tree decomposition Mk landscapes

Files

3449726.3459427.pdf (574.46 KB)

Publication date

2021-07

Authors

Thierens, DirkISNI 0000000390770297
Driessel, van, Tobias

Editors

Chicano, Francisco
Krawiec, Krzysztof

Advisors

Supervisors

DOI

https://doi.org/10.1145/3449726.3459427

Document Type

Part of book

Metadata

Show full item record

Collections

Utrecht University Repository
Open Access logo

License

taverne

Abstract

We introduce the CliqueTreeMk algorithm to construct tree decomposition (TD) Mk Landscapes and to compute their global optimum efficiently. TD Mk Landscapes are well suited to serve as benchmark functions for blackbox genetic algorithms that are not given a priori the structural problem information as specified by the tree structure and their associated codomain fitness values. Specifically, for certain types of codomains the use of linkage learning might prove to be necessary in order to be able to solve these type of fitness functions.

Keywords

Benchmarking, Decomposable Landscapes, Dynamic Programming, Taverne

Citation

Thierens, D & Driessel, van, T 2021, A benchmark generator of tree decomposition Mk landscapes. in F Chicano & K Krawiec (eds), Proceedings of the Genetic and Evolutionary Computation Conference. Association for Computing Machinery, pp. 229-230, Genetic and Evolutionary Computation Conference, 10/07/21. https://doi.org/10.1145/3449726.3459427, conference

URI

https://dspace.library.uu.nl/handle/1874/420307