A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem

A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem

0.00 Avg rating0 Votes
Article ID: iaor2001839
Country: United States
Volume: 32
Issue: 2
Start Page Number: 142
End Page Number: 162
Publication Date: May 1998
Journal: Transportation Science
Authors: ,
Keywords: networks
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 on, the paremeters 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.

Reviews

Required fields are marked *. Your email address will not be published.