Stochastic Optimization of Empty Container Repositioning of Sea Carriage

Abstract:

To improve the efficiency of empty container repositioning for a shipping company, a stochastic optimization model of empty container repositioning of sea carriage was established by chance-constrained programming. The objective function was to minimize the cost of empty container repositioning including shipping, rening and shortage cost. In the model, shipping cost was decided by the number of ship used for empty container repositioning. The constraints of the model included meeting the need of empty containers, limit to the number of empty containers provided and the capacity of shipping. The numbers of empty containers required are stochastic. The stochastis model was transferred to an integer programming one. Lingo9.0 was used to solve the model and simulation was done under varied parameters to get a good shipping strategy. The results show that the model can provide an effective program of empty container repositioning for a shipping company and it is a good way to raise shipping efficiency.

• Periodical: Advanced Materials Research (Volume 340)
• Pages: 324-330
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.340.324
• Online since: September 2011
• Authors: Bin Wang, Tao Yang
• Keywords: Chance Constrained Programming, Container, Empty Container, Line, Simulation

References

[1] X. Shi, The Optimization of Sea-bound Empty Container Distribution, Systems Engineering-theory & Practice, no. 4, pp.70-89, April (2003).

[2] H.J. Liu and X Shi, Simulation of collection and allocation of empty containers based on Petri net, Journal of Traffic and Transportation Engineering. Vol. 3, No. 9, pp.97-102, Sep (2002).

[3] D.Z. Zhao and J. Huang, Research on Optimization of Empty Container Distribution Based on Integral Cost of Ocean Shipping and Land-Carriage, Journal of Beijing Jiaotong University(Social Sciences Edition), Vol. 7, No. 4, pp.48-74, October (2008).

[4] Z.Y. Wu, T.S. Song and K. Zhao, Selection of Container Shipping Routes,. Journal of Southwest Jiaotong University, Vol. 41, No. 3, pp.269-272, June (2006).

[5] R.K. Cheung and C.Y. Chen. A two-stage stochastic netwok modal and solution methods for the dynamic empty container allocation problem,. Transportation Science, No. 32, pp.142-162, May (1998).

DOI: 10.1287/trsc.32.2.142

[6] S.W. Lam, L.H. Lee and L.C. Tang, An approximate dynamic programming approach for the empty container allocation problem,. Transportation Research Part C, No. 15, pp.265-277, August (2007).

DOI: 10.1016/j.trc.2007.04.005

[7] J.A. Li ,S.C.H. Leung, Y. Wu , K. Liu, Allocation of empty containers between multi-ports,. European Journal of operational research, pp.400-412, October (2007).

DOI: 10.1016/j.ejor.2006.09.003

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

DOI: 10.1016/j.tre.2005.05.003

[9] B.D. Liu, R.Q. Zhao,G. Wang. Uncertain programming with Applications,. Tsinghua University Press, Beijing, March, (2004).