Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results

DOI10.1287/ijoc.2013.0552zbMath1356.90026MaRDI QIDQ2967619

Miao Song, Jia Shu

Publication date: 1 March 2017

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2013.0552

zbMATH Keywords

liner shipping; two-stage robust optimization; time-expanded network; empty repositioning

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90B80: Discrete location and assignment

Related Items

Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties, An effective global algorithm for worst-case linear optimization under polyhedral uncertainty, A survey of adjustable robust optimization, A computational study for common network design in multi-commodity supply chains

Cites Work

• Unnamed Item
• Allocation of empty containers between multi-ports
• Robust discrete optimization and network flows
• Adjustable robust solutions of uncertain linear programs
• Robust solutions of linear programming problems contaminated with uncertain data
• Robust Convex Optimization
• A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem
• Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• A Robust Optimization Perspective on Stochastic Programming
• A Linear Decision-Based Approximation Approach to Stochastic Programming
• The Price of Robustness
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• A Variable-Complexity Norm Maximization Problem
• An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
• An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times
• An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times
• A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems
• Robust Optimization for Empty Repositioning Problems
• Dynamic and Stochastic Models for the Allocation of Empty Containers
• Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming