The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem
Abstract
Containerized liner trades have been growing steadily since the globalization of world economies intensified in the early 1990s. However, these trades are typically imbalanced in terms of the numbers of inbound and outbound containers. As a result, the relocation of empty containers has become one of the major problems faced by liner operators. In this paper, we consider the dynamic empty container allocation problem where we need to reposition empty containers and to determine the number of leased containers needed to meet customers' demand over time. We formulate this problem as a two-stage stochastic network: in stage one, the parameters such as supplies, demands, and ship capacities for empty containers are deterministic; whereas in stage two, these parameters are random variables. We need to make decisions in stage one such that the total of the stage one cost and the expected stage two cost is minimized. By taking advantage of the network structure, we show how a stochastic quasi-gradient method and a stochastic hybrid approximation procedure can be applied to solve the problem. In addition, we propose some new variations of these methods that seem to work faster in practice. We conduct numerical tests to evaluate the value of the two-stage stochastic model over a rolling horizon environment and to investigate the behavior of the solution methods with different implementations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An algorithm for quadratic programming
Frank, M., & Wolfe, P. (1956) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800030109 · Cited by 3,030
Scenarios and Policy Aggregation in Optimization Under Uncertainty
Rockafellar, R. T., & Wets, R. J.-B. (1991) · Mathematics of Operations Research · doi:10.1287/moor.16.1.119 · Cited by 1,340
L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
Van Slyke, R. M., & Wets, R. (1969) · SIAM Journal on Applied Mathematics · doi:10.1137/0117061 · Cited by 1,281
Accelerated Stochastic Approximation
Kesten, H. (1958) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706705 · Cited by 433
Dynamic and Stochastic Models for the Allocation of Empty Containers
Crainic, T. G., Gendreau, M., & Dejax, P. (1993) · Operations Research · doi:10.1287/opre.41.1.102 · Cited by 380
A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems
Frantzeskakis, L. F., & Powell, W. B. (1990) · Transportation Science · doi:10.1287/trsc.24.1.40 · Cited by 145
A tabu search procedure for multicommodity location/allocation with balancing requirements
Crainic, T. G., Michel Gendreau, A., Patrick Soriano, A., & Toulouse, M. (1993) · Annals of Operations Research · doi:10.1007/bf02023001 · Cited by 136
Stochastic Quasigradient Methods
Ermoliev, Y. M. (2008) · Springer eBooks · doi:10.1007/978-0-387-74759-0_662 · Cited by 121
Shipping Container Logistics and Allocation
Lai, K. K., Lam, K., & Chan, W. K. (1995) · Journal of the Operational Research Society · doi:10.1057/jors.1995.98 · Cited by 90
EMPTY-CONTAINER REPOSITIONING AND LEASING: AN OPTIMIZATION MODEL.
Florez, H. (1986) · Cited by 27
Nonlinear Programming Techniques Applied to Stochastic Programs with Recourse
Nazareth, L., & Wets, R. J. ‐. (1988) · Springer series in computational mathematics · doi:10.1007/978-3-642-61370-8_4 · Cited by 13
Cited by
Transshipment of containers at a container terminal: An overview
Vis, I. F. A., & de Koster, R. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00293-x · Cited by 738
The container shipping network design problem with empty container repositioning
Shintani, K., Imai, A., Nishimura, E., & Papadimitriou, S. (2007) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2005.05.003 · Cited by 349
Minimizing fuel emissions by optimizing vessel schedules in liner shipping with uncertain port times
Qi, X., & Song, D.-P. (2012) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2012.02.001 · Cited by 284
Mahmoudi, M., & Parviziomran, I. (2020) · International Journal of Production Economics · doi:10.1016/j.ijpe.2020.107730 · Cited by 192
On the Values of Vehicle-to-Grid Electricity Selling in Electric Vehicle Sharing
Zhang, Y., Lu, M., & Shen, S. (2020) · Manufacturing & Service Operations Management · doi:10.1287/msom.2019.0855 · Cited by 78
Metadata
- Authors
- Cheung, R. K., & Chen, C.-Y.
- Venue
- Transportation Science
- Published
- 1998-05
- Volume
- 32
- Issue
- 2
- Pages
- 142-162
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2081558217
- Cited by
- 252
- References
- 11
- FWCI
- 7.70
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.