The sample average approximation method for empty container repositioning with uncertainties

DOI10.1016/j.ejor.2012.04.018zbMath1253.90051MaRDI QIDQ1926912

Loo Hay Lee, Yin Long, Ek Peng Chew

Publication date: 29 December 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.04.018

zbMATH Keywords

transportation; sample average approximation; scenario decomposition; progressive hedging; empty container repositioning

Mathematics Subject Classification ID

62P20: Applications of statistics to economics

90B06: Transportation, logistics and supply chain management

Related Items

Simulation Optimization: A Review and Exploration in the New Era of Cloud Computing and Big Data, Joint tank container demurrage policy and flow optimisation using a progressive hedging algorithm with expanded time-space network, Uncertainty in maritime ship routing and scheduling: a literature review, Empty container management and coordination in intermodal transport, A new separable piecewise linear learning algorithm for the stochastic empty container repositioning problem, Sample average approximation under non-i.i.d. sampling for stochastic empty container repositioning problem, Substitution-based equipment balancing in service networks with multiple equipment types, A new convergent hybrid learning algorithm for two-stage stochastic programs

Cites Work

• Unnamed Item
• Allocation of empty containers between multi-ports
• Positioning empty containers among multiple ports with leasing and purchasing considerations
• Using scenario trees and progressive hedging for stochastic inventory routing problems
• Approximate scenario solutions in the progressive hedging algorithm. A numerical study with an application to fisheries management
• Container terminal operation and operations research -- a classification and literature review
• The sample average approximation method applied to stochastic routing problems: a computational study
• 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
• Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Fleet Sizing and Empty Equipment Redistribution for Center-Terminal Transportation Networks
• Robust Optimization for Empty Repositioning Problems
• Dynamic and Stochastic Models for the Allocation of Empty Containers