Solving a class of simulation-based optimization problems using ``optimality in probability
From MaRDI portal
Abstract: We approach a class of discrete event simulation-based optimization problems using optimality in probability, an approach which yields what is termed a "champion solution". Compared to the traditional optimality in expectation, this approach favors the solution whose actual performance is more likely better than that of any other solution; this is an effective alternative to the traditional optimality sense, especially when facing a dynamic and nonstationary environment. Moreover, using optimality in probability is computationally promising for a class of discrete event simulation-based optimization problems, since it can reduce computational complexity by orders of magnitude compared to general simulation-based optimization methods using optimality in expectation. Accordingly, we have developed an "Omega Median Algorithm" in order to effectively obtain the champion solution and to fully utilize the efficiency of well-developed off-line algorithms to further facilitate timely decision making. An inventory control problem with nonstationary demand is included to illustrate and interpret the use of the Omega Median Algorithm, whose performance is tested using simulations.
Recommendations
Cites work
- scientific article; zbMATH DE number 51708 (Why is no real title available?)
- scientific article; zbMATH DE number 1300385 (Why is no real title available?)
- scientific article; zbMATH DE number 232493 (Why is no real title available?)
- scientific article; zbMATH DE number 3322720 (Why is no real title available?)
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- A Simple Heuristic for Computing Nonstationary (s, S) Policies
- A restricted multinomial hybrid selection procedure
- A simple proof for optimality of (s, S) policies in infinite-horizon inventory systems
- A static-dynamic strategy for spare part inventory systems with nonstationary stochastic demand
- Adaptive inventory control for nonstationary demand and partial information
- Approximation Algorithms for Stochastic Inventory Control Models
- Burst-level congestion control using hindsight optimization
- Computing Optimal (s, S) Inventory Policies
- Discrete Optimization via Simulation Using COMPASS
- Dynamic version of the economic lot size model
- Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy
- Foundations of inventory management
- Integrating Replenishment Decisions with Advance Demand Information
- Inventory control.
- Nested Partitions Method for Global Optimization
- On the Opimality of $( {s,S} )$ Inventory Policies: New Conditions and a New Proof
- On-line optimal control of a class of discrete event systems with real-time constraints
- Ordinal Optimization
- Perturbation analysis for online control and optimization of stochastic fluid models
- Probability Inequalities for Sums of Bounded Random Variables
- Sample Path Derivatives for (s, S) Inventory Systems
- Social choice and individual values
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
- The classical average-cost inventory models of Iglehart and Veinott-Wagner revisited
Cited in
(4)- Simulation-Based Optimality Tests for Stochastic Programs
- The equivalence between ordinal optimization in deterministic complex problems and in stochastic simulation problems
- Discrete conditional-expectation-based simulation optimization: methodology and applications
- scientific article; zbMATH DE number 177250 (Why is no real title available?)
This page was built for publication: Solving a class of simulation-based optimization problems using ``optimality in probability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1745940)
