Short-term liner ship fleet planning with container transshipment and uncertain container shipment demand
DOI10.1016/j.ejor.2012.06.025zbMath1253.90052OpenAlexW2109615465MaRDI QIDQ1926991
Tingsong Wang, Shuaian Wang, Qiang Meng
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.06.025
stochastic integer programminglogisticsliner shippingcontainer transshipment and uncertain demandsample average approximation with dual decomposition and Lagrangian relaxation
Mixed integer programming (90C11) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)
Related Items (18)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal operating strategy for a long-haul liner service route
- Supply chain design under uncertainty using sample average approximation and dual decomposition
- A branch and bound method for stochastic global optimization
- Dual decomposition in stochastic integer programming
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Ship scheduling: The last decade
- Dispatching of small containers via coastal freight liners: The case of the Aegean sea.
- Optimal empty vehicle repositioning and fleet-sizing for two-depot service systems
- A stochastic programming approach for supply chain network design under uncertainty
- On Optimal Allocation of Indivisibles Under Uncertainty
- 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
- An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution
- A Fluid Flow Model for Empty Container Repositioning Policy with a Single Port and Stochastic Demand
- Routing Container Ships Using Lagrangean Relaxation and Decomposition
- Two-Stage Fleet Assignment Model Considering Stochastic Passenger Demands
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Lectures on Stochastic Programming
- A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership
- The Vehicle Routing Problem with Stochastic Travel Times
- An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
- Introduction to Stochastic Programming
- Dynamic and Stochastic Models for the Allocation of Empty Containers
- The Maritime Pickup and Delivery Problem with Time Windows and Split Loads
This page was built for publication: Short-term liner ship fleet planning with container transshipment and uncertain container shipment demand