An approximate dynamic programming approach for the empty container allocation problem

Container Slot Co-Allocation Planning with Joint Fleet Agreement in a Round Voyage for Liner Shipping

“…Empty container repositioning was studied by Li, et al (2004), Lam, et al (2007) and Shintani, et al (2007). Space allocation planning in container terminals was studied by Zhang, et al (2003) and Bazzazi, et al (2009).…”

Optimization of empty container movements in intermodal transport

“…The operations of a company are expected to continue until far in the future or even infinity. Lam et al (2007) propose to use average cost formulations in an infinite horizon framework. According to Crainic et al (1993b), most models cover only a finite planning horizon consisting of several periods.…”

“…(Crainic et al, 1993b;Crainic, 2002) Principal decisions that have to be made at each planning level are discussed in the following paragraphs. (Crainic et al, 1993b;Lam et al, 2007) Strategic planning typically involves long-term planning decisions such as large capital investments. Decisions at this level include designing the physical network by choosing locations of container depots and other facilities, depot and fleet sizing, acquiring resources, determining customer zones and defining broad service policies.…”

“…. 13 2.4 Overview of decisions for empty container repositioning (Crainic et al, 1993b;Lam et al, 2007 …”

Multiple Periods Minimal Cost Programming Optimization Model for Empty Containers Repositioning with Stock Level

“…They propose a time space network model which is the opening maritime ECR network modeling for discussion. Lam et al [10] apply the actual service schedule so that the general networking techniques to shipping industry can be developed. An approximate dynamic programming approach in operational strategies for ECR is proposed.…”