Sample average approximation under non-i.i.d. sampling for stochastic empty container repositioning problem

DOI10.1007/s00291-015-0389-8zbMath1311.90012OpenAlexW2015462375MaRDI QIDQ2018108

Yin Long, Ek Peng Chew, Loo Hay Lee

Publication date: 10 April 2015

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-015-0389-8

zbMATH Keywords

stochastic optimizationsample average approximationempty container repositioningsupersaturated designnon-i.i.d. sampling

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Related Items (2)

Optimal subsidy design for shore power usage in ship berthing operations ⋮ Uncertainty in maritime ship routing and scheduling: a literature review

Cites Work

• Unnamed Item
• The impact of sampling methods on bias and variance in stochastic linear programs
• Uniform exponential convergence of sample average random functions under general sampling with applications in stochastic programming
• Using scenario trees and progressive hedging for stochastic inventory routing problems
• A branch and bound method for stochastic global optimization
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• The sample average approximation method applied to stochastic routing problems: a computational study
• Construction of \(E(s^2)\)-optimal supersaturated designs
• The sample average approximation method for empty container repositioning with uncertainties
• A stochastic programming approach for supply chain network design under uncertainty
• A General Method of Constructing E(s2)-Optimal Supersaturated Designs
• A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Progressive hedging-based metaheuristics for stochastic network design
• On Rates of Convergence for Stochastic Optimization Problems Under Non–Independent and Identically Distributed Sampling
• Orthogonal Array-Based Latin Hypercubes
• Generating Systematic Supersaturated Designs
• Robust Optimization for Empty Repositioning Problems
• Convergence properties of two-stage stochastic programming

This page was built for publication: Sample average approximation under non-i.i.d. sampling for stochastic empty container repositioning problem