View in EDS

Dice and slice simulation optimization for high-dimensional discrete problems.

Saved in:
Bibliographic Details
Title: Dice and slice simulation optimization for high-dimensional discrete problems.
Authors: Avci, Harun1 (AUTHOR) havci@kennesaw.edu, Nelson, Barry L.2 (AUTHOR) nelsonb@northwestern.edu, Song, Eunhye3 (AUTHOR) esong32@gatech.edu, Wächter, Andreas2 (AUTHOR) andreas.waechter@northwestern.edu
Source: European Journal of Operational Research. May2026, Vol. 330 Issue 3, p850-863. 14p.
Subjects: Gaussian Markov random fields, Optimization algorithms, Asymptotic analysis, Surrogate-based optimization, Statistical decision making, Multi-objective optimization
Abstract: • We propose DASSO for high-dimensional discrete simulation optimization problems. • DASSO decomposes the prior on the objective function into an additive form. • DASSO makes rapid search progress by identifying the best-CEI solution to simulate. • DASSO is asymptotically convergent to the optimal solution. Although much progress has been made in simulation optimization, problems involving computationally expensive simulations having high-dimensional, discrete decision-variable spaces have been stubbornly resistant to solution. For this class of problems we propose Dice and Slice Simulation Optimization (DASSO). DASSO is a form of Bayesian optimization that represents the prior on the objective function implied by the simulation as a sum of low-dimensional Gaussian Markov random fields. This prior is consistent with the full-dimensional objective function, rather than assuming that it is actually separable. By working iteratively between posteriors on these low-dimensional "dice" and a full-dimensional "slice" of the decision-variable space, DASSO makes rapid progress with little algorithm overhead even on problems with more than a trillion feasible solutions. We achieve further computational savings by showing that we can find the best solution to simulate on each iteration without having to assess the potential of all solutions—as is traditionally done in Bayesian optimization—by identifying a small set of Pareto-optimal solutions in subsets of the dimensions. We prove that DASSO is asymptotically convergent to the optimal solution, while emphasizing that its most important feature is the ability to find good solutions quickly in problems beyond the capability of other methods. [ABSTRACT FROM AUTHOR]
Copyright of European Journal of Operational Research is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:• We propose DASSO for high-dimensional discrete simulation optimization problems. • DASSO decomposes the prior on the objective function into an additive form. • DASSO makes rapid search progress by identifying the best-CEI solution to simulate. • DASSO is asymptotically convergent to the optimal solution. Although much progress has been made in simulation optimization, problems involving computationally expensive simulations having high-dimensional, discrete decision-variable spaces have been stubbornly resistant to solution. For this class of problems we propose Dice and Slice Simulation Optimization (DASSO). DASSO is a form of Bayesian optimization that represents the prior on the objective function implied by the simulation as a sum of low-dimensional Gaussian Markov random fields. This prior is consistent with the full-dimensional objective function, rather than assuming that it is actually separable. By working iteratively between posteriors on these low-dimensional "dice" and a full-dimensional "slice" of the decision-variable space, DASSO makes rapid progress with little algorithm overhead even on problems with more than a trillion feasible solutions. We achieve further computational savings by showing that we can find the best solution to simulate on each iteration without having to assess the potential of all solutions—as is traditionally done in Bayesian optimization—by identifying a small set of Pareto-optimal solutions in subsets of the dimensions. We prove that DASSO is asymptotically convergent to the optimal solution, while emphasizing that its most important feature is the ability to find good solutions quickly in problems beyond the capability of other methods. [ABSTRACT FROM AUTHOR]
ISSN:03772217
DOI:10.1016/j.ejor.2026.01.005