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

DOI10.1007/S00291-015-0389-8zbMATH Open1311.90012OpenAlexW2015462375MaRDI QIDQ2018108FDOQ2018108

Authors: 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

Recommendations

• The sample average approximation method for empty container repositioning with uncertainties
• The sample average approximation method applied to stochastic routing problems: a computational study
• An inexact sample average approximation approach for the stochastic connected facility location problem
• Enhancing the sample average approximation method with \(U\) designs
• Uniform exponential convergence of sample average random functions under general sampling with applications in stochastic programming

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Title not available (Why is that?)
• Orthogonal Array-Based Latin Hypercubes
• A stochastic programming approach for supply chain network design under uncertainty
• The sample average approximation method for stochastic discrete optimization
• 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
• On Rates of Convergence for Stochastic Optimization Problems Under Non–Independent and Identically Distributed Sampling
• The impact of sampling methods on bias and variance in stochastic linear programs
• A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem
• Robust optimization for empty repositioning problems
• Convergence properties of two-stage stochastic programming
• Progressive hedging-based metaheuristics for stochastic network design
• Using scenario trees and progressive hedging for stochastic inventory routing problems
• Uniform exponential convergence of sample average random functions under general sampling with applications in stochastic programming
• Construction of \(E(s^2)\)-optimal supersaturated designs
• A general method of constructing \(E(s^2)\)-optimal supersaturated designs.
• Generating Systematic Supersaturated Designs
• The sample average approximation method for empty container repositioning with uncertainties

Cited In (5)

• A new separable piecewise linear learning algorithm for the stochastic empty container repositioning problem
• Uncertainty in maritime ship routing and scheduling: a literature review
• The sample average approximation method for empty container repositioning with uncertainties
• Optimal subsidy design for shore power usage in ship berthing operations
• Enhancing the sample average approximation method with \(U\) designs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018108)