The sample average approximation method applied to stochastic routing problems: a computational study
From MaRDI portal
Recommendations
- An inexact sample average approximation approach for the stochastic connected facility location problem
- Robust Stochastic Approximation Approach to Stochastic Programming
- Monte Carlo sampling approach to stochastic programming
- The sample average approximation method for stochastic discrete optimization
- Sample average approximation methods for a class of stochastic variational inequality problems
Cited in
(93)- On feasibility of sample average approximation solutions
- Stochastic global optimization using tangent minorants for Lipschitz functions
- Special issue: Global solution of integer, stochastic and nonconvex optimization problems
- The workload balancing problem at air cargo terminals
- An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation
- Stochastic polynomial optimization
- An optimal method for stochastic composite optimization
- On risk-averse maximum weighted subgraph problems
- Managing congestion in a multi-modal transportation network under biomass supply uncertainty
- Simulation-Based Optimality Tests for Stochastic Programs
- In Memoriam: Shabbir Ahmed (1969–2019)
- Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables
- A vehicle routing problem with distribution uncertainty in deadlines
- Sales and operations planning in systems with order configuration uncertainty
- A sample average approximation method based on a D-gap function for stochastic variational inequality problems
- A two-stage stochastic programming model for transportation network protection
- Sample average approximation for risk-averse problems: a virtual power plant scheduling application
- Adaptive and nonadaptive approaches to statistically based methods for solving stochastic linear programs: a computational investigation
- Multi-commodity distribution under uncertainty in disaster response phase: model, solution method, and an empirical study
- Influence maximization with deactivation in social networks
- Variance reduction in Monte Carlo sampling-based optimality gap estimators for two-stage stochastic linear programming
- An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem
- Scheduling deferrable electric appliances in smart homes: a bi-objective stochastic optimization approach
- Sample average approximation under non-i.i.d. sampling for stochastic empty container repositioning problem
- Optimal insurance contract specification in the upstream sector of the oil and gas industry
- Itinerary planning with time budget for risk-averse travelers
- Railway disruption management: designing bus bridging services under uncertainty
- Stochastic shortest path problem with delay excess penalty
- A comparative study of decomposition algorithms for stochastic combinatorial optimization
- An arc-exchange decomposition method for multistage dynamic networks with random arc capacities
- Stable annual scheduling of medical residents using prioritized multiple training schedules to combat operational uncertainty
- The sample average approximation method for empty container repositioning with uncertainties
- A study on the optimal inventory allocation for clinical trial supply chains
- A smoothing projected HS method for solving stochastic tensor complementarity problem
- Validation analysis of mirror descent stochastic approximation method
- An inexact sample average approximation approach for the stochastic connected facility location problem
- Stochastic programming approach to optimization under uncertainty
- Integrated supply chain planning under uncertainty using an improved stochastic approach
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels
- Distributionally robust Weber problem with uncertain demand
- The effect of few historical data on the performance of sample average approximation method for operating room scheduling
- An approach to the distributionally robust shortest path problem
- A two-step gradient estimation approach for setting supply chain operating parameters
- Flexible solutions to maritime inventory routing problems with delivery time windows
- Simultaneous location and vehicle fleet sizing of relief goods distribution centers and vehicle routing for post-disaster logistics
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
- Derivatives of likelihood ratios and smoothed perturbation analysis for the routing problem
- Routing optimization with time windows under uncertainty
- A stochastic programming approach for supply chain network design under uncertainty
- Robust Stochastic Approximation Approach to Stochastic Programming
- Logarithmic sample bounds for sample average approximation with capacity- or budget-constraints
- When can we improve on sample average approximation for stochastic optimization?
- A maritime inventory routing problem with stochastic sailing and port times
- A cutting plane method for risk-constrained traveling salesman problem with random arc costs
- A single cut proximal bundle method for stochastic convex composite optimization
- Block mirror stochastic gradient method for stochastic optimization
- A hybrid heuristic for a stochastic production-inventory-routing problem
- Evaluating appointment postponement in scheduling patients at a diagnostic clinic
- Kernel entropy discriminant analysis for dimension reduction
- A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity
- Commitment under uncertainty: Two-stage stochastic matching problems
- New reformulations of distributionally robust shortest path problem
- Liner ship bunkering and sailing speed planning with uncertain demand
- Robust data-driven vehicle routing with time windows
- Approximation of probabilistic constraints in stochastic programming problems with a probability measure kernel
- Constrained shortest path with uncertain transit times
- A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction
- A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling
- Multi-echelon supply chain design considering unreliable facilities with facility hardening possibility
- Whole blood or apheresis donations? A multi-objective stochastic optimization approach
- An ADMM algorithm for two-stage stochastic programming problems
- Enhancing Benders decomposition algorithm to solve a combat logistics problem
- Spare parts inventory routing problem with transshipment and substitutions under stochastic demands
- A probability metrics approach for reducing the bias of optimality gap estimators in two-stage stochastic linear programming
- Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation
- Enhancing the sample average approximation method with \(U\) designs
- Multi-modal cargo logistics distribution problem: decomposition of the stochastic risk-averse models
- On complexity of multistage stochastic programs
- Approximation algorithms for stochastic and risk-averse optimization
- On sample size control in sample average approximations for solving smooth stochastic programs
- Wasserstein distributionally robust shortest path problem
- A smooth penalty-based sample average approximation method for stochastic complementarity problems
- A solution method for a two-dispatch delivery problem with stochastic customers
- A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty
- A capacitated lot sizing problem with stochastic setup times and overtime
- Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios
- Reformulation and sampling to solve a stochastic network interdiction problem
- A stochastic programming model for service scheduling with uncertain demand: an application in open-access clinic scheduling
- M-estimators for models with a mix of discrete and continuous parameters
- Scalable Optimal Classifiers for Adversarial Settings Under Uncertainty
- Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs
- Implementable algorithm for stochastic optimization using sample average approximations
This page was built for publication: The sample average approximation method applied to stochastic routing problems: a computational study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1866135)
