DIGNEA: A tool to generate diverse and discriminatory instance suites for optimisation domains

Rice, 1976, The algorithm selection problem, Adv Comput, 15, 65, 10.1016/S0065-2458(08)60520-3 Kerschke, 2019, Automated algorithm selection: Survey and perspectives, Evol Comput, 27, 3, 10.1162/evco_a_00242 Pisinger, 2005, Where are the hard Knapsack problems?, Comput Oper Res, 32, 2271, 10.1016/j.cor.2004.03.002 Smith-Miles, 2021, Revisiting where are the hard Knapsack problems? via instance space analysis, Comput Oper Res, 128, 10.1016/j.cor.2020.105184 Michalak, 2021, Generating hard inventory routing problem instances using evolutionary algorithms, 243 Alissa, 2019, Algorithm selection using deep learning without feature extraction, 198 Bossek, 2019, Evolving diverse TSP instances by means of novel and creative mutation operators, 58 Plata-González, 2019, Evolutionary-based tailoring of synthetic instances for the Knapsack problem, Soft Comput, 23, 12711, 10.1007/s00500-019-03822-w Julstrom, 2009, Evolving heuristically difficult instances of combinatorial problems, 279 Akgün, 2019, Instance generation via generator instances, 3 Ullrich, 2018, A generic problem instance generator for discrete optimization problems, 1761 Lehman, 2011, Abandoning objectives: Evolution through the search for novelty alone, Evol Comput, 19, 189, 10.1162/EVCO_a_00025 Marrero, 2022, A novelty-search approach to filling an instance-space with diverse and discriminatory instances for the Knapsack problem, 223 León, 2009, METCO: A parallel plugin-based framework for multi-objective optimization, Int J Artif Intell Tools, 18, 569, 10.1142/S0218213009000275 Marrero, 2021, A parallel genetic algorithm to speed up the resolution of the algorithm selection problem, 1978