The sample average approximation method applied to stochastic routing problems: a computational study
From MaRDI portal
Publication:1866135
DOI10.1023/A:1021814225969zbMath1094.90029WikidataQ89211408 ScholiaQ89211408MaRDI QIDQ1866135
Anton J. Kleywegt, Shabbir Ahmed, Bram Verweij, Nemhauser, George I., Alexander Shapiro
Publication date: 3 April 2003
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Related Items
Stochastic Shortest Path Problem with Delay Excess Penalty, Scheduling deferrable electric appliances in smart homes: a bi-objective stochastic optimization approach, Variance reduction in Monte Carlo sampling-based optimality gap estimators for two-stage stochastic linear programming, Kernel Entropy Discriminant Analysis for Dimension Reduction, A solution method for a two-dispatch delivery problem with stochastic customers, An arc-exchange decomposition method for multistage dynamic networks with random arc capacities, On sample size control in sample average approximations for solving smooth stochastic programs, Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights, Reformulation and sampling to solve a stochastic network interdiction problem, A two-step gradient estimation approach for setting supply chain operating parameters, A maritime inventory routing problem with stochastic sailing and port times, Flexible solutions to maritime inventory routing problems with delivery time windows, Multi-commodity distribution under uncertainty in disaster response phase: model, solution method, and an empirical study, New reformulations of distributionally robust shortest path problem, Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands, When can we improve on sample average approximation for stochastic optimization?, Logarithmic sample bounds for sample average approximation with capacity- or budget-constraints, Approximation of probabilistic constraints in stochastic programming problems with a probability measure kernel, An ADMM algorithm for two-stage stochastic programming problems, Enhancing Benders decomposition algorithm to solve a combat logistics problem, An approach to the distributionally robust shortest path problem, Multi-modal cargo logistics distribution problem: decomposition of the stochastic risk-averse models, Railway disruption management: designing bus bridging services under uncertainty, The sample average approximation method for empty container repositioning with uncertainties, Routing optimization with time windows under uncertainty, A smoothing projected HS method for solving stochastic tensor complementarity problem, The effect of few historical data on the performance of sample average approximation method for operating room scheduling, Simultaneous location and vehicle fleet sizing of relief goods distribution centers and vehicle routing for post-disaster logistics, Evaluating appointment postponement in scheduling patients at a diagnostic clinic, On risk-averse maximum weighted subgraph problems, Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs, Sample average approximation for risk-averse problems: a virtual power plant scheduling application, A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty, M-estimators for models with a mix of discrete and continuous parameters, Influence maximization with deactivation in social networks, Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation, Block mirror stochastic gradient method for stochastic optimization, An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation, Stable annual scheduling of medical residents using prioritized multiple training schedules to combat operational uncertainty, Distributionally robust Weber problem with uncertain demand, Approximation Algorithms for Stochastic and Risk-Averse Optimization, The workload balancing problem at air cargo terminals, On Feasibility of Sample Average Approximation Solutions, An optimal method for stochastic composite optimization, Integrated supply chain planning under uncertainty using an improved stochastic approach, A probability metrics approach for reducing the bias of optimality gap estimators in two-stage stochastic linear programming, A sample average approximation method based on a D-gap function for stochastic variational inequality problems, In Memoriam: Shabbir Ahmed (1969–2019), Managing congestion in a multi-modal transportation network under biomass supply uncertainty, Simulation-Based Optimality Tests for Stochastic Programs, Constrained shortest path with uncertain transit times, A stochastic programming model for service scheduling with uncertain demand: an application in open-access clinic scheduling, A hybrid heuristic for a stochastic production-inventory-routing problem, Optimal insurance contract specification in the upstream sector of the oil and gas industry, Spare parts inventory routing problem with transshipment and substitutions under stochastic demands, Stochastic global optimization using tangent minorants for Lipschitz functions, Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios, A capacitated lot sizing problem with stochastic setup times and overtime, A study on the optimal inventory allocation for clinical trial supply chains, Whole blood or apheresis donations? A multi-objective stochastic optimization approach, Itinerary planning with time budget for risk-averse travelers, Commitment under uncertainty: Two-stage stochastic matching problems, A two-stage stochastic programming model for transportation network protection, A stochastic programming approach for supply chain network design under uncertainty, A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity, Sales and operations planning in systems with order configuration uncertainty, Sample average approximation under non-i.i.d. sampling for stochastic empty container repositioning problem, Validation analysis of mirror descent stochastic approximation method, A cutting plane method for risk-constrained traveling salesman problem with random arc costs, Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels, A vehicle routing problem with distribution uncertainty in deadlines, Stochastic programming approach to optimization under uncertainty, Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables, A comparative study of decomposition algorithms for stochastic combinatorial optimization, Stochastic polynomial optimization, Liner ship bunkering and sailing speed planning with uncertain demand, Wasserstein distributionally robust shortest path problem, Multi-echelon supply chain design considering unreliable facilities with facility hardening possibility, Robust Data-Driven Vehicle Routing with Time Windows, A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling, Special issue: Global solution of integer, stochastic and nonconvex optimization problems, On complexity of multistage stochastic programs, A smooth penalty-based sample average approximation method for stochastic complementarity problems
