We first train a set of heuristics using a classical GP hyperheuristic algorithm on lower-level instances. The lower-level problem is a parametric covering problem with non-binary coefficient matrix. Despite investigations, we did not find any library proposing instances for such covering problems. Instead of generating them from scratch, we turned our attention to the OR-library [65]. This library provides various instances for different combinatorial problems. The closest problem with such non-binary matrix coefficients and binary decision variables is the Multi-dimensional Knapsack Problem (MKP). We therefore modified the MKP instances found at the OR-library (http://people.brunel.ac.uk/ mastjjb/jeb/info.html) such that all ≤ constraints becomes ≥-constraints. We also ensure that each modified instance has a non-empty search space. All instances used in this work can be found at https://gitlab.uni.lu/ekieffer/instances.