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

No abstract is available for this paper.

• Publication year

  2015

• Venue

  OR Spectr.

• Publication date

  2015-03-01

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1007/s00291-015-0389-8
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• International trade and freight distribution

  2013cited by this paper
• The impact of sampling methods on bias and variance in stochastic linear programs

  2012cited by this paper
• The sample average approximation method for empty container repositioning with uncertainties

  2012cited by this paper
• Progressive hedging‐based metaheuristics for stochastic network design

  2011cited by this paper
• Uniform exponential convergence of sample average random functions under general sampling with applications in stochastic programming

  2010cited by this paper
• Enhancing the sample average approximation method with U designs

  2010cited by this paper
• Robust Optimization for Empty Repositioning Problems

  2009cited by this paper
• Using scenario trees and progressive hedging for stochastic inventory routing problems

  2009cited by this paper
• The Effect of Multi-Scenario Policies on Empty Container Repositioning under Uncertainty and Data Shortage

  2009cited by this paper
• On Rates of Convergence for Stochastic Optimization Problems Under Non--Independent and Identically Distributed Sampling

  2008cited by this paper
• A heuristic solution for the empty container substitution problem

  2008cited by this paper
• Empty container reposition planning for intra-Asia liner shipping

  2008cited by this paper
• Production, Manufacturing and Logistics A stochastic programming approach for supply chain network design under uncertainty

  2005cited by this paper
• Construction of E(s^2)-optimal supersaturated designs

  2004cited by this paper
• Sample average approximation methods for stochastic MINLPs

  2004cited by this paper
• The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study

  2003cited by this paper
• The Sample Average Approximation Method for Stochastic Discrete Optimization

  2002cited by this paper
• The Sample Average Approximation Method for Stochastic Programs with Integer Recourse

  2002cited by this paper
• A general method of constructing E(s2)‐optimal supersaturated designs

  2001cited by this paper
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code

  2000cited by this paper
• Convergence Properties of Two-Stage Stochastic Programming

  2000cited by this paper
• Monte Carlo bounding techniques for determining solution quality in stochastic programs

  1999cited by this paper
• A branch and bound method for stochastic global optimization

  1998cited by this paper
• A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem

  1998cited by this paper
• Generating Systematic Supersaturated Designs

  1995cited by this paper
• Orthogonal Array-Based Latin Hypercubes

  1993cited by this paper
• Random number generation and Quasi-Monte Carlo methods

  1992cited by this paper

• A robust rolling horizon framework for empty repositioning

  2022cites this paper
• Clustered federated learning multi-classifier for non-IID scenario in drone devices

  2022cites this paper
• Uncertainty in maritime ship routing and scheduling: A Literature review

  2022cites this paper
• Optimal subsidy design for shore power usage in ship berthing operations

  2021cites this paper
• Classification and literature review on the integration of simulation and optimization in maritime logistics studies

  2020influential citation
• Approaches to empty container repositioning problems in the context of Eurasian intermodal transportation

  2019cites this paper
• Empty Container Allocation in B2C E-commerce

  2019cites this paper
• Route Planning for Military Ground Vehicles in Road Networks under Uncertain Battlefield Environment

  2018cites this paper
• An optimization model for management of empty containers in distribution network of a logistics company under uncertainty

  2018cites this paper
• CHALLENGES AND OPPORTUNITIES IN INTEGRATION OF SIMULATION AND OPTIMIZATION IN MARITIME LOGISTICS

  2018cites this paper
• The role of consignees in empty container management

  2016cites this paper
• Optimization in container liner shipping

  2016cites this paper
• Empty container exchange among liner carriers

  2015cites this paper