A new separable piecewise linear learning algorithm for the stochastic empty container repositioning problem

DOI10.1155/2020/4762064zbMath1459.90234OpenAlexW3082505654MaRDI QIDQ2007112

Shaorui Zhou, Zhiming Chen, Xiaopo Zhuo, Yi Tao

Publication date: 12 October 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/4762064

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Stochastic programming (90C15) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
• Encroachment and canvassing strategy in a sea-cargo service chain with empty container repositioning
• Efficient solution selection for two-stage stochastic programs
• Empty container management and coordination in intermodal transport
• The sample average approximation method for empty container repositioning with uncertainties
• A smoothing algorithm for a new two-stage stochastic model of supply chain based on sample average approximation
• A new convergent hybrid learning algorithm for two-stage stochastic programs
• A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem
• An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution
• An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
• An Adaptive Dynamic Programming Algorithm for the Heterogeneous Resource Allocation Problem
• An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times
• Shape – A Stochastic Hybrid Approximation Procedure for Two-Stage Stochastic Programs
• Robust Optimization for Empty Repositioning Problems
• Optimal threshold control of empty vehicle redistribution in two depot service systems
• Dynamic and Stochastic Models for the Allocation of Empty Containers
• An Optimal Approximate Dynamic Programming Algorithm for Concave, Scalar Storage Problems With Vector-Valued Controls
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems

This page was built for publication: A new separable piecewise linear learning algorithm for the stochastic empty container repositioning problem