An approximate dynamic programming approach for the empty container allocation problem

doi:10.1016/j.trc.2007.04.005

Return

An approximate dynamic programming approach for the empty container allocation problem

2007-08-01

125

PRE

Loo Hay Lee *

Loon‐Ching Tang

DOI：10.1016/j.trc.2007.04.005

Original

Original request for help

Save

Abstract

En 中文

The objective of this study is to demonstrate the successful application of an approximate dynamic programming approach in deriving effective operational strategies for the relocation of empty containers in the containerized sea-cargo industry. A dynamic stochastic model for a simple two-ports two-voyages (TPTV) system is proposed first to demonstrate the effectiveness of the approximate optimal solution obtained through a simulation based approach known as the temporal difference (TD) learning for average cost minimization. An exact optimal solution can be obtained for this simple TPTV model. Approximate optimal results from the TPTV model utilizing a linear approximation architecture under the TD framework can then be compared to this exact solution. The results were found comparable and showed promising improvements over an existing commonly used heuristics. The modeling and solution approach can be extended to a realistic multiple-ports multiple-voyages (MPMV) system. Some results for the MPMV case are shown. (C) 2007 Elsevier Ltd. All rights reserved.

Keywords:

dynamic container allocation

temporal difference learning

average cost minimization

sea cargo

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.