Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 99 for “"sample average approximation"”.

  1. Sample Average Approximation of Risk-Averse Stochastic Programs

    Sample average approximation (SAA) is a well-known solution methodology for traditional stochastic programs which are risk neutral in the sense that they consider optimization of expectation functionals. In this thesis we establish sample average approximation methods for two classes of …

    gatech Repository record for Sample Average Approximation of Risk-Averse Stochastic Programs (opens in a new tab)

  2. The Sample Average Approximation Method Appliedto Transportation Procurement Auction Problemunder Uncertainty

    This thesis proposes to apply the sample average approximation method to solve the lanebundling problem under demand uncertainty.In the previous work, we investigated thepossibility of forming packages within a company™s own distribution network and proposed astochastic model which was …

    nus Repository record for The Sample Average Approximation Method Appliedto Transportation Procurement Auction Problemunder Uncertainty (opens in a new tab) Download file for The Sample Average Approximation Method Appliedto Transportation Procurement Auction Problemunder Uncertainty (opens in a new tab)

  3. PPE Distribution Planning and Capacity Acquisition During the COVID-19 Pandemic

    … Benders decomposition and approxi- mated using sample average approximation. Benders decomposition and sample average approximation produce similar results with an optimality gap of less than 1%. Benders decomposition requires about 20 minutes to solve, while sample average approximation …

    waterloo Repository record for PPE Distribution Planning and Capacity Acquisition During the COVID-19 Pandemic (opens in a new tab)

  4. Some Unconventional Stochastic Programs

    … in analyzing solution approaches such as the sample average approximation method or the stochastic approximation algorithm. Nevertheless, this assumption fails for many real-world problems, e.g., linear regression problems with data-dependent constraints. Without the condition, the solutions …

    gatech Repository record for Some Unconventional Stochastic Programs (opens in a new tab)

  5. Sampling Controlled Stochastic Recursions: Applications to Simulation Optimization and Stochastic Root Finding

    … years, Robbins and Monros original stochastic approximation algorithm and its numerous modern incarnations have seen only mixed success in solving SO problems. The primary reason for this is stochastic approximations explicit reliance on a sequence of algorithmic parameters to guarantee …

    vt Repository record for Sampling Controlled Stochastic Recursions: Applications to Simulation Optimization and Stochastic Root Finding (opens in a new tab)

  6. Operating room planning with the pooling of downstream beds among specialties: A stochastic programming approach

    … the proposed stochastic programing model in a sample average approximation framework. We have carried out extensive computational experiments to evaluate the effectiveness of several pooling policies for downstream beds and also the efficiency of the proposed sample average approximation …

    concordia Download PDF for Operating room planning with the pooling of downstream beds among specialties: A stochastic programming approach (opens in a new tab)

  7. A Multi-period supply planning problem for managing stochastic demand

    … under varying conditions, we introduce the Sample Average Approximation (SAA) and Lagrangean Decomposition methods. Additionally, to better simulate the uncertainties present in real-world scenarios, we employ Monte Carlo simulations to generate diverse cases, enabling the model to produce …

    concordia Download PDF for A Multi-period supply planning problem for managing stochastic demand (opens in a new tab)

  8. A Location-Inventory Problem for Customers with Time Constraints

    … procedure is studied and embedded into the sample average approximation (SAA) method. The computation experiments demonstrate that our combined SAA with dual heuristic algorithm has a similar performance on solution quality and a much shorter compu- tational time.

    mcmaster Repository record for A Location-Inventory Problem for Customers with Time Constraints (opens in a new tab)

  9. Improving the blood supply chain: simulation and optimisation models to support collection, production and location-allocation decisions

    … augmented epsilon-constraint algorithm and the sample average approximation technique. A Pareto front considering stochastic demand is obtained by applying the proposed method. The final model included studies the optimal design of a blood supply chain as well as a discussion about the main …

    soton Download PDF for Improving the blood supply chain: simulation and optimisation models to support collection, production and location-allocation decisions (opens in a new tab)

  10. Dual-Based Local Search for Deterministic, Stochastic and Robust Variants of the Connected Facility Location Problem

    … extend the use of well-known methods such as the sample average approximation for stochastic optimization and the Bertsimas and Sim approach for robust optimization with heuristics and lower bounding mechanisms. This is particular important for NP-complete problems where even deterministic and …

    maryland Repository record for Dual-Based Local Search for Deterministic, Stochastic and Robust Variants of the Connected Facility Location Problem (opens in a new tab)

  11. Hub Location Problems with Profit Considerations

    … algorithm is developed that integrates a sample average approximation scheme with the proposed Benders decomposition algorithm. Novel acceleration techniques are presented to improve the convergence of the algorithm. The efficiency and robustness of the algorithm are evaluated through …

    waterloo Repository record for Hub Location Problems with Profit Considerations (opens in a new tab)

  12. An optimization model for strategic supply chain design under stochastic capacity disruptions

    … a two-stage non-linear formulation and the Sample Average Approximation (SAA) procedure to solve the problem near optimality. We also propose a simple heuristic procedure to avoid the nonlinearity issue. The sampling and heuristic optimization procedures were implemented in a spreadsheet …

    tamu Repository record for An optimization model for strategic supply chain design under stochastic capacity disruptions (opens in a new tab)

  13. Develop a multistage stochastic program with recourse for scheduling prescribed burning based fuel treatments with consideration of future wildland fires and fire suppressions

    … of independent and identical (i.i.d.) fire samples across the entire planning horizon. Each simulated sample fire ignites at a random location and spreads for a random duration under the influence of a randomly selected wind direction and speed. This stochastic program explicitly addresses …

    colostate Repository record for Develop a multistage stochastic program with recourse for scheduling prescribed burning based fuel treatments with consideration of future wildland fires and fire suppressions (opens in a new tab)

  14. Implementation and assessment of demand response and voltage/var control with distributed generators

    … program. The solution stage is based on sample average approximation (SAA), and the validation stage is based on multiple replication procedure (MRP) to test the robustness of the sample average approximation solutions of the stochastic program. This research applies big data-driven …

    gatech Repository record for Implementation and assessment of demand response and voltage/var control with distributed generators (opens in a new tab)

  15. A Network Design Approach for Circular Medical Waste Management using Two-stage Stochastic MILP Optimization

    … to the robustness of the model. The use of the Sample Average Approximation (SAA) technique efficiently handles the computational complexities of the two-stage stochastic MILP model, making it applicable to large-scale problems. Moreover, the research showcases the data analysis undertaken to …

    mcmaster Repository record for A Network Design Approach for Circular Medical Waste Management using Two-stage Stochastic MILP Optimization (opens in a new tab)

  16. Data-driven Nonparametric Joint Chance-Constrained Programming for Power Systems Scheduling

    … lack reliability or scenario-based methods like sample average approximation with limited performance with finite samples. The data-driven nonparametric JCC models presented in this work make no assumption on the type and shape of random variable PDFs. Line flow and reserve constraints are …

    lsu-thes Repository record for Data-driven Nonparametric Joint Chance-Constrained Programming for Power Systems Scheduling (opens in a new tab)

  17. Data Science and the Ice-Cream Vendor Problem

    … expected value is a function of temperature. A sample average approximation technique is subsequently used to transform the stochastic newsvendor program into a feature-driven linear program based on the exogenous factors of probability of rainfall and temperature. The resulting problem is a …

    etsu Repository record for Data Science and the Ice-Cream Vendor Problem (opens in a new tab) Download PDF for Data Science and the Ice-Cream Vendor Problem (opens in a new tab)

Page 1 of 5