Generating new test instances by evolving in instance space

DOI10.1016/J.COR.2015.04.022MaRDI QIDQ342041zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

benchmarkinggraph colouringtest instancesevolving instancesinstance space

Mathematics Subject Classification ID

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

Recommendations

• Evolving test instances of the Hamiltonian completion problem
• Towards objective measures of algorithm performance across instance space
• Core instances for testing: a case study
• scientific article; zbMATH DE number 1982188
• Discovering the suitability of optimisation algorithms by learning from evolved instances

Cites work

• scientific article; zbMATH DE number 5005350 (Why is no real title available?)
• scientific article; zbMATH DE number 2039272 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 956856 (Why is no real title available?)
• A mixed evolutionary-statistical analysis of an algorithm's complexity
• A supernodal formulation of vertex colouring with applications in course timetabling
• Discovering the suitability of optimisation algorithms by learning from evolved instances
• Evolutionary Computation in Combinatorial Optimization
• Exploring the role of graph spectra in graph coloring algorithm performance
• Facet defining inequalities among graph invariants: The system graphedron
• Feature Article—Toward an Experimental Method for Algorithm Simulation
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Generating applicable synthetic instances for branch problems
• Maximal energy bipartite graphs
• Measuring instance difficulty for combinatorial optimization problems
• Needed: An Empirical Science of Algorithms
• Old and new results on algebraic connectivity of graphs
• Some relations between rank, chromatic number and energy of graphs
• Synthetic optimization problem generation: show us the correlations!
• Testing heuristics: We have it all wrong
• The energy of a graph
• The linear ordering problem: instances, search space analysis and algorithms
• Towards objective measures of algorithm performance across instance space
• What makes an optimization problem hard?.

Cited in

(23)

• Instance space analysis for 2D bin packing mathematical models
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Evolving test instances of the Hamiltonian completion problem
• A new class of hard problem instances for the 0-1 knapsack problem
• scientific article; zbMATH DE number 1982188 (Why is no real title available?)
• Towards objective measures of algorithm performance across instance space
• Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning
• The international timetabling competition on sports timetabling (ITC2021)
• Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
• Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
• Core instances for testing: a case study
• Instance space analysis for a personnel scheduling problem
• Discovering the suitability of optimisation algorithms by learning from evolved instances
• Instance space analysis and algorithm selection for the job shop scheduling problem
• scientific article; zbMATH DE number 956856 (Why is no real title available?)
• Enhanced instance space analysis for the maximum flow problem
• Generation techniques for linear programming instances with controllable properties
• On normalization and algorithm selection for unsupervised outlier detection
• A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem
• Instance spaces for machine learning classification
• Relating instance hardness to classification performance in a dataset: a visual approach
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis

Describes a project that uses

Uses Software

• GraPHedron
• DIMACS
• SteinLib

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342041)