Synthetic Optimization Problem Generation: Show Us the Correlations!
INFORMS Journal on Computing · 2009 · Volume 21 · Issue 3
Abstract
In many computational experiments, correlation is induced between certain types of coefficients in synthetic (or simulated) instances of classical optimization problems. Typically, the correlations that are induced are only qualified—that is, described by their presumed intensity. We quantify the population correlations induced under several strategies for simulating 0–1 knapsack problem instances and also for correlation-induction approaches used to simulate instances of the generalized assignment , capital budgeting ( or multidimensional knapsack ), and set-covering problems . We discuss implications of these correlation-induction methods for previous and future computational experiments on simulated optimization problems.
Keywords
random variable generation, correlation, 0–1 knapsack problem, generalized assignment problem, capital budgeting problem, set-covering problem
Enable JavaScript for citation tools and additional paper interactions.