A recursive model for static empty container allocation

Abstract

Backlogged empty containers have gradually turned into a serious burden to shipping networks. Empty container allocation has become an urgent settlement issue for the container shipping industry on a global scale. Therefore, this paper proposes an improved immune algorithm based recursive model for optimizing static empty container allocation which integrates with the global maritime container shipping network. This model minimizes the operating and capital costs during container shipping considering 0-1 mixed-integer programming. So an immune algorithm procedure based on a special two-dimensional chromosome encoding is proposed. Finally, computational experiments are performed to optimize a 10-port static empty container shipping system. The results indicate that the proposed recursive model for static empty container allocation is effective in making an optimal strategy for empty container allocation.

Keywords

immune algorithm / shipping network / empty container allocation

References

[1] Shen W S, Khoong C M A. DSS for empty container distribution planning. Decision Support Systems, 1995, 15(1): 75-82

[2] Choong S T, Cole M H, Kutanoglu E. Empty container management for intermodal transportation networks. Transportation Research Part E, Logistics and Transportation Review, 2002, 38(6): 423-438

[3] Li J A, Leung S C H, Wu Y, Liu K. Allocation of empty containers between multi-port. European Journal of Operational Research, 2007, 182(1): 400-412

[4] Crainic T G, Gendreau M, Dejax P. Dynamic and stochastic-models for the allocation of empty containers. Operations Research, 1993, 41(1): 102-126

[5] Cheung R K, Chen C Y. A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem. Transportation Science, 1998, 32(2): 142-162

[6] Jula H, Chassiakos A, Ioannou P. Port dynamic empty container reuse. Transportation Research Part E, Logistics and Transportation Review, 2006, 42(1): 43-60

[7] Lam S W, Lee L H, Tang L C. An approximate dynamic programming approach for the empty container allocation problem. Transportation Research Part C, Emerging Technologies, 2007, 15(4): 265-277

[8] Shintani K, Imai A, Nishimura E, Papadimitriou S. The container shipping network design problem with empty container repositioning. Transportation Research Part E, Logistics and Transportation Review, 2007, 43(1): 39-59

[9] Cullinane K, Khanna M. Economies of scale in large containerships: optimal size and geographical implications. Journal of Transport Geography, 2000, 8(3): 181-195

[10] Farmer J D, Packard N H, Perelson A S. The immune system, adaptation, and machine learning. Physica D: Nonlinear Phenomena, 1986, 2(1-3): 187-204

[11] Yang J G,Luo Z H. Coalition formation mechanism in multi-agent systems based on genetic algorithms. Applied Soft Computing, 2007, 7 (2): 561-568

Acknowledgements

The authors express thanks to the National Natural Science Foundation of China (Grant No. 51079022) for its financial support.

RIGHTS & PERMISSIONS

2014 Higher Education Press and Springer-Verlag Berlin Heidelberg