2Cheung R K, Chen C Y. A two-stage stochastic network model and solution methods for the dynamic empty container allocation Problem [ J ]. Transportation Science, 1998, 32 (2) : 142-162.
3Choong S T, Cole M H. Kutanoglu E, Empty container management for intermodal transportation networks[ J]. Transportation Researeh Part E, 2002, 38: 423-438.
4Li J A, Liu K, Leung S C H, Lai K K. Empty container management in a port with long-run average criterion[ J ]. Mathemati- cal & Computer Modelling, 2004, 40(1-2) : 85-100.
5Lam S W, Lee L H, Tang L C. An approximate dynamic programming approach for the empty container allocation problem [J]. Transportation Research Part C, 2007, 15(4) : 265-277.
6Meng Q, Wang S A. Liner shipping service network design with empty container repositioning[ J]. Transportation Research Part E. 2011. 47, 695-708.
7Cheang B, Lim A. A network flow based method for the distribution of empty containers[ J]. International Journal of Computer Applications in Technology, 2005, 22(4) : 198-204.
8Lai KK, Lam K, Chan W K. Shipping container logistics and allocation [ J]. Journal of the Operational Research Society, 1995, 6(46): 687-697.
9Li J A, Leung S C H, Wu Y, Liu K. Allocation of empty containers between multi-Ports[ J]. European Journal of Operation- al Research, 2007,182( 1 ) : 400-412.
10Shintani K, Imai A, Nishimura E, Papadimitriou S. The container shipping network design problem with empty container repositioning[ J]. Transportation Research Part E, 2007, 43 ( 1 ) : 39-59.
