Article ID: | iaor1994217 |
Country: | United States |
Volume: | 41 |
Issue: | 1 |
Start Page Number: | 102 |
End Page Number: | 126 |
Publication Date: | Jan 1993 |
Journal: | Operations Research |
Authors: | Crainic Teodor Gabriel, Dejax Pierre, Gendreau Michel |
Keywords: | networks: flow, stochastic processes |
The empty container allocation problem occurs in the context of the management of the land distribution and transportation operations of international maritime shipping companies. It involves dispatching empty containers of various types in response to requests by export customers and repositioning other containers to storage depots or ports in anticipation of future demands. The authors describe the problem and identify its basic structure and main characteristics. They then introduce two dynamic deterministic formulations for the single and multicommodity cases, which offer a general modeling framework for this class of problems, and which account for its specific characteristics: the space and time dependency of events, substitutions among container types, relationships with partner companies, imports and exports, massive equilibration flows, etc. Finally, the authors provide a mathematical formulation for handling, in the single commodity case, the uncertainty of demand and supply data that is characteristic of container allocation and distribution problems. Various modeling choices, data requirements, and algorithmic considerations related to the implementation of the models are also discussed.