Generating new test instances by evolving in instance space

DOI10.1016/j.cor.2015.04.022zbMath1349.68325OpenAlexW815914887WikidataQ62033329 ScholiaQ62033329MaRDI QIDQ342041

Simon Bowly, Kate A. Smith-Miles

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.04.022

zbMATH Keywords

graph colouringbenchmarkingtest instancesevolving instancesinstance space

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (16)

A new class of hard problem instances for the 0-1 knapsack problem ⋮ Enhanced instance space analysis for the maximum flow problem ⋮ Instance space analysis and algorithm selection for the job shop scheduling problem ⋮ A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem ⋮ The international timetabling competition on sports timetabling (ITC2021) ⋮ Features for the 0-1 knapsack problem based on inclusionwise maximal solutions ⋮ Instance spaces for machine learning classification ⋮ On normalization and algorithm selection for unsupervised outlier detection ⋮ Generation techniques for linear programming instances with controllable properties ⋮ Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning ⋮ Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis ⋮ Machine learning for combinatorial optimization: a methodological tour d'horizon ⋮ Instance space analysis for a personnel scheduling problem ⋮ MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library ⋮ Relating instance hardness to classification performance in a dataset: a visual approach ⋮ Evolving test instances of the Hamiltonian completion problem

Uses Software

• SteinLib
• DIMACS
• GraPHedron

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards objective measures of algorithm performance across instance space
• Exploring the role of graph spectra in graph coloring algorithm performance
• Discovering the suitability of optimisation algorithms by learning from evolved instances
• A supernodal formulation of vertex colouring with applications in course timetabling
• Old and new results on algebraic connectivity of graphs
• Facet defining inequalities among graph invariants: The system graphedron
• What makes an optimization problem hard?.
• Some relations between rank, chromatic number and energy of graphs
• Maximal energy bipartite graphs
• The energy of a graph
• Measuring instance difficulty for combinatorial optimization problems
• The linear ordering problem: instances, search space analysis and algorithms
• A mixed evolutionary-statistical analysis of an algorithm's complexity
• Testing heuristics: We have it all wrong
• Generating Applicable Synthetic Instances for Branch Problems
• Synthetic Optimization Problem Generation: Show Us the Correlations!
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Needed: An Empirical Science of Algorithms
• Feature Article—Toward an Experimental Method for Algorithm Simulation
• Evolutionary Computation in Combinatorial Optimization

This page was built for publication: Generating new test instances by evolving in instance space