Please use this identifier to cite or link to this item:
Title: An approximate dynamic programming approach for the empty container allocation problem
Authors: Lam, S.-W. 
Lee, L.-H. 
Tang, L.-C. 
Keywords: Average cost minimization
Dynamic container allocation
Sea cargo
Temporal difference learning
Issue Date: Aug-2007
Citation: Lam, S.-W., Lee, L.-H., Tang, L.-C. (2007-08). An approximate dynamic programming approach for the empty container allocation problem. Transportation Research Part C: Emerging Technologies 15 (4) : 265-277. ScholarBank@NUS Repository.
Abstract: 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. © 2007 Elsevier Ltd. All rights reserved.
Source Title: Transportation Research Part C: Emerging Technologies
ISSN: 0968090X
DOI: 10.1016/j.trc.2007.04.005
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Oct 26, 2021


checked on Oct 26, 2021

Page view(s)

checked on Oct 14, 2021

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.